engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Searching, Sorting and Hashing Sorting
In Merge-sort, Merge Function is called inside merge-sort recursion. What are best and worst case comparison needed if two sorted subarray of size m and n are given
1
min(m, n), m + n – 1
2
max(m, n), m + n – 1
3
max(m, n), m + n
4
min(m, n), m + n