Register

Recent questions tagged heap-sort

1 votes
0 answers
31
Heapsort #Virtualgate
Need approach to solve this ?
Need approach to solve this ?
User Avatar
6 votes
1 answer
33
Heapsort
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks...
User Avatar
1 votes
1 answer
34
HeapSort
There are 3 D&C basis sorting Algos Quick sort :- T(k)+T(n-k)+ Cn Merge sort :- 2T(n/2) +Cn Heap sort :- ___________ I know how the complexity of heap sort is O(nlogn) but I don't know recurrence relation of Heap sort .
There are 3 D&C basis sorting AlgosQuick sort :- T(k)+T(n-k)+ CnMerge sort :- 2T(n/2) +Cn Heap sort :- ___________I know how the complexity of heap sort is O(nlogn) but ...
User Avatar
0 votes
1 answer
35
Divide and Conquer
Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?
Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?
User Avatar
2 votes
4 answers
36
GATE Overflow | Algorithms | Test 1 | Question: 19
Is an array that is sorted in decreasing order a max-heap? always yes always no sometimes only yes but not in presence of duplicates
Is an array that is sorted in decreasing order a max-heap?always yesalways nosometimes onlyyes but not in presence of duplicates
User Avatar
1 votes
1 answer
37
heap sort
The number of elements that can be sorted in time using heap sort ?
The number of elements that can be sorted in time using heap sort ?
User Avatar
1 votes
0 answers
38
Heap Sort
Why is the space complexity of heap sort O(1) and not O(log n) even if Heap sort internally calls max_heapify whose space complexity is O(log n) due to the stack (recursion)? And if it is O(log n), it should not be an in-place sorting algorithm.
Why is the space complexity of heap sort O(1) and not O(log n) even if Heap sort internally calls max_heapify whose space complexity is O(log n) due to the stack (recursi...
User Avatar
2 votes
1 answer
39
UGC NET CSE | June 2013 | Part 2 | Question: 28
The time complexity to build a heap with a list of n numbers is O(log n) O(n) O(n logn) O(n$^2$)
The time complexity to build a heap with a list of n numbers isO(log n)O(n)O(n logn)O(n$^2$)
User Avatar
1 votes
1 answer
41
K sorted list,n/k elements what is time complexity?please specifiy ur ans in detail
K sorted lists of n/k elements each. What is time complexity to sort them?please specifiy ur ans in detail
K sorted lists of n/k elements each. What is time complexity to sort them?please specifiy ur ans in detail
User Avatar
0 votes
3 answers
42
Heap Sort
4) The number of elements that can be sorted in Θ(logn) time using heap sort is (A) Θ(1) (B) Θ(sqrt(logn)) (C) Θ(Log n/(Log Log n)) (d) Θ(Log n)
4) The number of elements that can be sorted in Θ(logn) time using heap sort is (A) Θ(1)(B) Θ(sqrt(logn))(C) Θ(Log n/(Log Log n))(d) Θ(Log n)
User Avatar
1 votes
1 answer
43
Heap Sort best case
What is the Best Case run time of Heap Sort ? A. $O(1)$ B. $O(n)$ C. $O(n \log n)$ D. $O(\log n)$
What is the Best Case run time of Heap Sort ?A. $O(1)$B. $O(n)$C. $O(n \log n)$D. $O(\log n)$
User Avatar
0 votes
1 answer
44
Heap Sort
statement is true or false Heap sort is inplace algorithm. it is given as true but heapsort uses maxheapify procedure which requires extra stack ., then how it is inplace..?
statement is true or falseHeap sort is inplace algorithm. it is given as truebut heapsort uses maxheapify procedure which requires extra stack ., then how it is inplac...
User Avatar
113 votes
9 answers
45
GATE CSE 2013 | Question: 30
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)$
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)...
User Avatar
Page: