Questions tagged [heap-sort]
The heap-sort tag has no usage guidance.
3
votes
1answer
20 views
Are comparison sort algos appropriate for SUBJECTIVE sorting?
I've been tasked with creating an online feature that ranks 50 fantasy characters from a variety of domains based on combat acumen and polls users one which one is the most powerful based on their ...
0
votes
2answers
681 views
Worst case time complexity of heap sort
I was learning about heaps, and came to know that the worst case time complexity of heap sort is Ω(n lg n). I am having a hard time grasping this. My reasoning is as follows:
...
0
votes
0answers
793 views
Find K largest elements using a priority queue [duplicate]
Say we have a Priority Queue of size 1000 that is implemented using Max Heap.
Now if i want to get the top 5 elements, the most laid back method is to poll the maximum 5 times, resulting in a set of ...
4
votes
0answers
562 views
How to determine the fewest number of comparisons for Heapsort?
I'm currently doing an exercise that asks to prove that Standard-Heapsort requires at fewest $\frac{1}{8} n \log(n) - O(n)$ comparisons, in its best case.
In its average case, Heapsort only requires $...
0
votes
1answer
624 views
Why is Heapsort in O(n log n) if not all n operations take time log n?
let's consider that we already have constructed heap array.
so from this, when we do heap sort, the number of elements that have to be sorted decreased. I mean heap decrease.(which also means heap ...
0
votes
0answers
383 views
How to build a heap better than Incremental and In-place method using decision tree?
For an array A = [a1, a2, a3, a4] of distinct numbers, I have built heap using binary decision tree by Incremental and In-place method.
Incremental method:
In-place method:
Is there a way to build ...
0
votes
2answers
463 views
Heap sort best case time - $\mathcal O(n)$?
It is given $\mathcal O(n\log n)$ everywhere but in best case it should be $\mathcal O(n)$, isnt it ?
The argument here is, If my input has all the same keys, then every time I delete the root, I do ...
3
votes
1answer
122 views
Interesting question of Min Heap
If we store a min heap of $n$ elements , $\color{Blue}{[1,2, \dots n]}$ into an array, then what can be minimum value present at any index $i$ and maximum value present at any index $i$. (elements are ...
0
votes
0answers
62 views
Analysis on comparisons in a heap-like sorting algorithm
I've stumbled a heap-like sorting algorithm on the Internet as followed:
$\\$
For convenience, given a list of $2^n \; (n \in \mathbb{N^*})$ distinct numbers to be sorted increasingly.
Step 1: From ...
0
votes
1answer
541 views
When the heapsort worst case occurs?
The best-, average-, and worst case time complexity of Heapsort for $n$ distinct keys are all $\Theta(n \lg n)$.
What are the worst-case inputs for heapsort?
1
vote
1answer
363 views
Does Heapsort work in time o(n log n) in the best case?
Is it possible for Heapsort to work in time $o(n\log n)$ on certain inputs?
For example in case of Insertion sort it is possible, however when it comes to Quickssort it is not possible. What about ...
1
vote
0answers
76 views
Minimum exchanges for heap sort
I'm studying heap sort and was presented with the following question.
What is the minimum number of items that must be exchanged during a remove the maximum operation in a heap of size N? Give a ...
1
vote
1answer
547 views
Lower bound on distinct element heapsort
I've been self-studying algorithms and am currently working on one of the starred exercises from CLRS:
Exercise 6.4-5
Show that when all elements are distinct, the best-case running time of heapsort ...
0
votes
1answer
1k views
Build-Max-Heap vs. HeapSort
I'm not sure whether my definition for these 2 terms are correct. Hence, could you help me verify that:
HeapSort: A procedure which sorts an array in place.
Build-Max-Heap: A procedure which runs in ...
