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
6
votes
1answer
95 views

Python 3 simple external sort with heapq

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. ...
5
votes
1answer
170 views

Maximum Heap Container

I implemented this max-heap to satisfy the C++ Container requirements. I am fairly confident I implemented bubble_up, bubble_down...
2
votes
2answers
1k views

Heap Sort Implementation in Python

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? ...
3
votes
2answers
431 views

Min-Heap in JavaScript

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 ...
2
votes
2answers
2k views

Min&Max Heap implementation in .NET

Overview I was doing some performance optimization patterns when I stumbled upon PriorityQueue and I implemented for that reason ...
1
vote
1answer
334 views

Implemented heapsort algorithm in Java

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. ...
3
votes
1answer
465 views

Implementation of the Heap Sort algorithm in C++

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 ...
5
votes
3answers
259 views

Local heapsort in C++

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 ...
4
votes
1answer
434 views

Heap Sort in Scala

Trying to implement Heap Sort in Scala ...
2
votes
2answers
236 views

C++ Heap Sort In C++14

Realized I have never implemented heap sort. So here is my first attempt: ...
1
vote
1answer
153 views

Heapsort With Full-Scale Genericity

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 ...
6
votes
1answer
2k views

C++ Heap implementation

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 ...
4
votes
0answers
181 views

Heap sort in Rust

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 ...
4
votes
2answers
557 views

In-place sorting of a binary file using heapsort

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 ...
1
vote
1answer
101 views

heapifyDown in heapsort

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 ...
7
votes
1answer
198 views

Heapsort implementation in C++14

Please review the following implementation of heapsort and pay attention to the following: Have I correctly chosen the names InputIt and ...
7
votes
2answers
707 views

C++ Heap Sort Implementation

Just checking if I could still do it: ...