Linear probing: The probable largest search time grows logarithmically with the number of records (Q4728255): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q515810 |
Created claim: Wikidata QID (P12): Q61386872, #quickstatements; #temporary_batch_1712190744730 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Boris G. Pittel / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61386872 / rank | |||
Normal rank | |||
Revision as of 02:43, 4 April 2024
scientific article; zbMATH DE number 4003537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear probing: The probable largest search time grows logarithmically with the number of records |
scientific article; zbMATH DE number 4003537 |
Statements
Linear probing: The probable largest search time grows logarithmically with the number of records (English)
0 references
1987
0 references
hashing
0 references
worst-case performance
0 references
linear probing algorithm
0 references
