engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Searching, Sorting and Hashing Sorting
Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be:
1
m × n
2
minimum of m, n
3
maximum of m, n
4
m + n - 1