Given two sorted list of size $m$ and $n$ respectively. The number of comparisons needed the worst case by the merge sort algorithm will be:
option d
worst case comparisons in merge sort is o(m+n-1)
Why not C .....Both list are already Sorted after minimum of (m,n) no. of comparison all remaining element get copied without comparison.
64.3k questions
77.9k answers
244k comments
80.0k users