Exponential bounds for the running time of a selection algorithm (Q760796): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90009-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048997247 / rank | |||
Normal rank | |||
Revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential bounds for the running time of a selection algorithm |
scientific article |
Statements
Exponential bounds for the running time of a selection algorithm (English)
0 references
1984
0 references
Hoare's selection algorithm for finding the kth-largest element in a set of n elements is shown to use C comparisons where (i) \(E(C^ p)\leq A_ pn^ p\) for some constant \(A_ p>0\) and all \(p\geq 1\); (ii) P(C/n\(\geq u)\leq (3/4)^{u(1+o(1))}\) as \(u\to \infty\). Exact values for the \(''A_ p''\) and ''o(1)'' terms are given.
0 references
Hoare's selection algorithm
0 references
