Kth Order Statistic: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 32: | Line 32: | ||
[[File:kth Order Statistic - Space.png|1000px]] | [[File:kth Order Statistic - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:kth Order Statistic - Pareto Frontier.png|1000px]] | [[File:kth Order Statistic - Pareto Frontier.png|1000px]] | ||
Revision as of 14:34, 15 February 2023
Description
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.
Parameters
n: size of list
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Naive Selection | 1940 | $O(nlogn)$ | $O({1})$ (can use in-situ sorting) | Exact | Deterministic | |
| Hoare's Selection Algorithm (QuickSelect) | 1961 | $O(n)$ | $O({1})$ (in-situ) | Exact | Deterministic | Time |
| Hashing | 1940 | $O(n)$ | $O(n)$ | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
References/Citation
https://11011110.github.io/blog/2007/10/09/blum-style-analysis-of.html