Given two sorted list of size 'm' and 'n' respectively. The number of…
PYQ Hexaware Hiring Assessment 2023
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
- A.
m × n
- B.
maximum of m, n
- C.
minimum of m, n
- D.
m + n – 1
Attempted by 400 students.
Sign up free to check your answer
Sign up freeLoading lesson…

