Linear probing: The probable largest search time grows logarithmically with the number of records (Q4728255)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4728255 |
scientific article; zbMATH DE number 4003537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7783747315406799
0 references
0.774224042892456
0 references
0.7632117867469788
0 references
0.7616944909095764
0 references
