retagged by
1,586 views

2 Answers

1 votes
1 votes

61 comparions is required.

 

Related questions

0 votes
0 votes
0 answers
1
Vikas123 asked Jan 8, 2019
1,034 views
Can anyone help me to understand this problem….??
3 votes
3 votes
1 answer
2
Kaushal Sanadhya asked Oct 9, 2018
1,687 views
How many swaps are performed in Merge sort algorithm in worst case?
0 votes
0 votes
3 answers
3
pradeepchaudhary asked Jul 8, 2018
1,528 views
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) (B) (C) (D)...
0 votes
0 votes
1 answer
4
Vipin Rai asked Nov 11, 2018
502 views
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?