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