MonusWeightedSearch.Examples.Sort

Sorting using the Heap monad.

The Heap monad can function like a normal heap (although it does need a Monus instead of just any ordered key), and as such it can implement a normal sorting algorithm.

Documentation

monusSort :: Monus m => [m] -> [m]

O(n log n). Heapsort.

>>> monusSort [5,1,2,3,1,6,3,2,5,7]
[1,1,2,2,3,3,5,5,6,7]