Weak Heapsort
Heapsort variant based on weak heaps, reducing the number of comparisons while retaining in-place sorting.
Tag
Heapsort
4 notes
4 notes
Heapsort variant based on weak heaps, reducing the number of comparisons while retaining in-place sorting.
Heapsort variant that uses a ternary heap with three children per node.
Heapsort variant that uses bottom up sift down to reduce comparisons during heapify.
Comparison sorting algorithm that builds a heap and repeatedly extracts the maximum.