Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

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

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1961

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?doid=366622.366647

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Hoare%27s_Selection_Algorithm_(QuickSelect)_(kth_Order_Statistic_kth_Order_Statistic)&oldid=47282"