Optimal alphabetic trees for binary search (Q293336)
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: Optimal alphabetic trees for binary search |
scientific article; zbMATH DE number 6590739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal alphabetic trees for binary search |
scientific article; zbMATH DE number 6590739 |
Statements
Optimal alphabetic trees for binary search (English)
0 references
9 June 2016
0 references
analysis of algorithms
0 references
alphabetic trees
0 references
binary search
0 references
two-way comparison search
0 references
0 references
0 references
0.9353884
0 references
0.92708945
0 references
0.9190116
0 references
0.91592205
0 references
0.91290754
0 references
0.91256475
0 references
0.9125517
0 references
