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.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Worst case: m+n−1 Best case: Min(m,n) raja11sep answered Jul 14, 2021 raja11sep comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 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 Mohit Kumar 6 answered May 4, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option D) The no of comparisons needed by merge sort in worst case is m+n-1 Sanandan answered Sep 9, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The number of comparisons needed in the worst case by the merge sort algorithm will be m+n-1 . heisenberggg answered Apr 6, 2021 heisenberggg comment Share Follow See all 0 reply Please log in or register to add a comment.