Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step?
Show answerHide answer
Correct answer: (B) Elements in each half of the array are sorted amongst themselves.
Explanation
After the two recursive calls in Mergesort complete, but before the merge step, elements in each half of the array are sorted amongst themselves because, Mergesort is possible when two arrays are sorted. If two unsorted arrays are submitted to Mergesort algorithm. It will sort each of them first before merging them, because Mergesort is a divide and conquer algorithm, Hence the answer is option (b).