Skip to main content

Questions tagged [heap-sort]

Heapsort is an efficient comparison-based sorting algorithm that divides an input into a sorted and an unsorted part and iteratively shrinks the unsorted part by extracting the largest element and moving that to the sorted part. Run time is O(n log n).

Filter by
Sorted by
Tagged with
7 votes
4 answers
552 views

I developed a heap sort variant that sorts a heap through traversal. Unlike in the standard heap sort, the algorithm does not remove the min element from the heap instead it traverses all the nodes of ...
ariko stephen's user avatar
-4 votes
1 answer
132 views

Help me with Pyramidal sorting by D. Knuth algorithm in C++. I would like to clarify if I followed the algorithm correctly. The code works. I have the function, but I'm not sure if my code fully ...
Loly18's user avatar
  • 1
8 votes
2 answers
443 views

I tried to optimize heap sort algorithm. Instead of recursion, I used iteration: ...
iskander's user avatar
  • 121
15 votes
5 answers
4k views

I have tried to implement my Heap in C. The following are the 13 operations defined: build_maxheap insert exctract_max (delete heap max root) max_delete (delete an element or key) max_heapify clear ...
V_head's user avatar
  • 575
8 votes
2 answers
588 views

Let's say you are living in a controlled economy where there is a baker in town, and every day he bakes a random number of loaves of bread (sometimes the oven breaks, or he has less ingredients). The ...
Tennis Tubbies's user avatar
3 votes
0 answers
154 views

The assumption is that k is quite large as compared to no. of elements in the array and division by 2 returns ceiling of the result. Request for your review and suggestions for further improvements ...
Deepak Mishra's user avatar
1 vote
1 answer
68 views

I have (designed and) implemented this fancy sorting algorithm that combines natural runs in the input array with a heap data structure: ...
coderodde's user avatar
  • 32.3k
3 votes
2 answers
428 views

NOTE: I am beginner in Python I learnt the Heap sort today and tried my own implementation using Python. Can i get feedback for my code and areas of improvement. I have tried to add comments inline, ...
prabh's user avatar
  • 151
-1 votes
3 answers
388 views

This code relies on Python3.7.4 I'm learning Heapsort in python 3. Please show me the errors in my code. Runs on my computer but tell me if Python rules or not. ...
Brijesh Kalkani's user avatar
7 votes
1 answer
1k views

I've implemented a minimal external sort of text file using heapq python module. On the few tests I did it seems to works well, but I would like to have some advice to have a cleaner and faster code. ...
RomainL.'s user avatar
  • 314
5 votes
1 answer
225 views

I implemented this max-heap to satisfy the C++ Container requirements. I am fairly confident I implemented bubble_up, bubble_down...
Brady Dean's user avatar
2 votes
2 answers
2k views

Objective: Create a heap sort that returns a unsorted list to sorted from greatest to least. Does this implementation look correct? Do you have any tips for optimizing this? ...
Johnathan's user avatar
  • 131
3 votes
2 answers
896 views

As part of my study on fundamentals, I have implemented the following code in JavaScript for a MinHeap data structure. Please have a look and I look forward to ...
Still Questioning's user avatar
3 votes
2 answers
4k views

Overview I was doing some performance optimization patterns when I stumbled upon PriorityQueue and I implemented for that reason ...
kuskmen's user avatar
  • 413
1 vote
1 answer
702 views

I am learning algorithms by using Java. Here is an implementation of heapsort. Let me know if anything is wrong and and suggestion to improve the algorithm. ...
Bahodir  Boydedayev's user avatar
3 votes
1 answer
997 views

I'm writing a little collection of sorting algorithms and some benchmarks (using Google benchmark). I wrote the following heap sort but I'm struggling in ...
Davide Spataro's user avatar
5 votes
3 answers
406 views

Suppose we need to sort a sequence and we know that every sequence component is within \$d\$ steps from its correct position. In such a case we can use a local heapsort: we take \$d\$ as an argument ...
coderodde's user avatar
  • 32.3k
4 votes
1 answer
769 views

Trying to implement Heap Sort in Scala ...
Loki Astari's user avatar
  • 97.7k
2 votes
2 answers
358 views

Realized I have never implemented heap sort. So here is my first attempt: ...
Loki Astari's user avatar
  • 97.7k
1 vote
1 answer
282 views

I've written a heapsort implementation. It's generic: generic comparators and sequences with elements of a generic type. The implementation (follows closely chapter 6 from Introduction to Algorithms ...
cadaniluk's user avatar
  • 187
6 votes
1 answer
3k views

I'm on my way of understanding basic data structures and sorting algorithms through implementing them in c++. Post is followed of my implementation of Vector. I decided to weld the heap behaviour ...
vatevr's user avatar
  • 81
4 votes
0 answers
268 views

The tests are taken from this answer on an insertion sort in rust question. The algorithm is taken from Algorithms in a Nutshell (2nd Edition). I'm not looking at crazy performance, the goal being ...
little-dude's user avatar
4 votes
2 answers
1k views

I have been working on sorting a file in-place with heapsort. I'm very glad it is working. But the time it takes is just too much. So I was wondering on how I could improve it. Here are my ...
BrainStone's user avatar
1 vote
1 answer
311 views

This is for heapsort and am wondering about the heapifyDown method. Here it is for review. I included relevant helper methods. The heap is stored in array starting ...
redbeans's user avatar
7 votes
1 answer
300 views

Please review the following implementation of heapsort and pay attention to the following: Have I correctly chosen the names InputIt and ...
alisianoi's user avatar
  • 315
7 votes
2 answers
928 views

Just checking if I could still do it: ...
Loki Astari's user avatar
  • 97.7k