5 votes 5 votes 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 : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$ Algorithms nielit2017dec-assistanta algorithms sorting merge-sort + – admin asked Mar 31, 2020 recategorized Aug 24, 2020 by Lakshman Bhaiya admin 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The worst case will be 0(m+n-1) where “m” and “n” are the sizes of the respective lists. Why “-1” at the end? because when the two lists are being compared and sorted, at the end 1 element might be left which requires no comparison, hence -1. rish1602 answered Jul 15, 2021 rish1602 comment Share Follow See all 0 reply Please log in or register to add a comment.