1,956 views
1 votes
1 votes
Which of the following algorithm gives best performance when items are in reverse order ?

a) Merge sort.

b) Heap sort.

1 Answer

Related questions

0 votes
0 votes
3 answers
1
aditi19 asked Oct 6, 2018
1,128 views
what is the recurrence relation for merge sort?
2 votes
2 votes
1 answer
2
Naveen Parihar asked Jun 26, 2018
2,019 views
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
1 votes
1 votes
1 answer
3
rahul sharma 5 asked Mar 9, 2018
1,282 views
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort?...
1 votes
1 votes
0 answers
4