retagged by
286 views

1 Answer

Related questions

2 votes
2 votes
4 answers
1
GateAspirant999 asked Feb 2, 2017
3,607 views
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst ca...
0 votes
0 votes
0 answers
2
Vikas123 asked Jan 8, 2019
1,040 views
Can anyone help me to understand this problem….??
3 votes
3 votes
1 answer
3
Kaushal Sanadhya asked Oct 9, 2018
1,691 views
How many swaps are performed in Merge sort algorithm in worst case?
0 votes
0 votes
3 answers
4
pradeepchaudhary asked Jul 8, 2018
1,531 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)...