# kth Order Statistic (kth Order Statistic)

Jump to navigation
Jump to search

## 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(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

## References/Citation

https://11011110.github.io/blog/2007/10/09/blum-style-analysis-of.html