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 |
Changed an Item |
||
| Property / author | |||
| Property / author: Boris G. Pittel / rank | |||
Normal rank | |||
Revision as of 02:50, 16 February 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
