Naive Selection (kth Order Statistic kth Order Statistic)
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
1940
Reference
-