Expected complexity of fast search with uniformly distributed data (Q1156487): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5538132 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Interpolation search—a log log <i>N</i> search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Understanding the complexity of interpolation search / rank | |||
Normal rank | |||
Latest revision as of 13:45, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected complexity of fast search with uniformly distributed data |
scientific article |
Statements
Expected complexity of fast search with uniformly distributed data (English)
0 references
1981
0 references
binary search
0 references
binomial distribution
0 references
data access
0 references
expected value
0 references
interpolation search
0 references
uniform distribution
0 references
