Heap Sort (Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 08:29, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O({1})$ (in-situ) words

((can be easily derived))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1964

Reference

https://www.bibsonomy.org/bibtex/2f485e4ea9a877871b59ab503151a7f10/bjoern

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Heap_Sort_(Comparison_Sorting_Sorting)&oldid=47280"