-
Juhani Krekelä authored
Heapsort has O(n·log(n)) worst case runtime and O(1) space usage, which is better than current implementation's best case, while still keeping the code simple. Co-authored-by: Jonas 'Sortie' Termansen <sortie@maxsi.org>
8b57a795