retagged by
522 views

2 Answers

0 votes
0 votes
1. Minimum no of comparison is ((3n)/2)-2. So then 6 is no of comparison if n= 5.

2. Heap sort is in-place algorithm but this is not a good explanation why we want to use it as an auxiliary sorting algorithm.

Related questions

2 votes
2 votes
1 answer
1
pankaj_vir asked Mar 19, 2018
1,485 views
0 votes
0 votes
1 answer
2
pradeepchaudhary asked Jul 8, 2018
3,257 views
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
0 votes
0 votes
0 answers
3
Rahul Ranjan 1 asked Jun 15, 2018
652 views
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort2. Quick Sort3. Merge Sort4. Heap Sort Please explain why others 3 sorting algorith...
2 votes
2 votes
1 answer
4
deepak mahapatra asked Jan 19, 2017
16,844 views
As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be...