kth Order Statistic (kth Order Statistic)

From Algorithm Wiki
Revision as of 09:04, 28 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


An algorithm seeks to find the $k^{th}$ order statistic of a statistical sample, or the $k^{th}$-smallest value in a list or array.


$n$: size of list

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Naive Selection 1940 $O(n \log n)$ $O({1})$ (in-situ) Exact Deterministic
Hoare's Selection Algorithm (QuickSelect) 1961 $O(n^{2})$ $O({1})$ (in-situ) Exact Deterministic Time
Hashing 1940 $O(n)$ $O(n)$ Exact Deterministic

Time Complexity Graph

Kth Order Statistic - Time.png