Wikis›01. Searching and Sorting›7. Divide and Conquer SortingWeak HeapsortHeapsort variant based on weak heaps, reducing the number of comparisons while retaining in-place sorting.
Wikis›01. Searching and Sorting›6. Elementary SortingWeak Heap SortA variant of heapsort using weak heaps with fewer comparisons.