Weak Heap Sort is a comparison-based in-place sorting algorithm that builds a weak heap, a variant of a binary heap, and repeatedly extracts the maximum element.
Paradigm
Heap / Weak Heap
Author
Dijkstra & Weak Heap Researchers
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties