1,090 views

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 :

1. $m^{*}n$
2. minimum of $m, n$
3. maximum of $m, n$
4. $m+n-1$

Worst case: m+n−1

Best case: Min(m,n)

OPTION D

The number of comparisons needed in the worst case by the merge sort algorithm will be m+n-1 i.e. only last element will not be compare only.

https://gateoverflow.in/60115/ugcnet-dec2013-ii-25

option D) The no of comparisons needed by merge sort in worst case is m+n-1
by

The number of comparisons needed in the worst case by the merge sort algorithm will be m+n-1 .