NIELIT 2017 DEC Scientific Assistant A - Section B: 53

Question

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. minimum of $m, n$
• C. maximum of $m, n$
• D. $m+n-1$

Answer 1

Worst case: m+n−1

Best case: Min(m,n)

Answer 2

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

Answer 3

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

Answer 4

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