Tree sort (Comparison Sorting Sorting)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(Derived: Need some way to store the tree of elements, so we need $O(n)$ auxiliary space.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1986
Reference
https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/978-1-349-08147-9_4