Search results for heap-sort

113 votes
8 answers
1
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
0 votes
1 answer
2
Worst case time complexity of heap sort for n elementsO(nlogn)O(logn)O^2O(n)
2 votes
4 answers
4
Is an array that is sorted in decreasing order a max-heap?always yesalways nosometimes onlyyes but not in presence of duplicates
1 votes
2 answers
5
Question The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
1 votes
3 answers
7
You are asked to sort 15 randomly generated numbers. One should prefer—(a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sortI think the answer should be c or d cr...
1 votes
3 answers
9
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?
1 votes
1 answer
10
2 votes
1 answer
11
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...
0 votes
0 answers
16
0 votes
0 answers
17
0 votes
1 answer
18
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...
1 votes
1 answer
20
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.