Selection of the optimum uniform partition search (Q1069708)
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: Selection of the optimum uniform partition search |
scientific article; zbMATH DE number 3936532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Selection of the optimum uniform partition search |
scientific article; zbMATH DE number 3936532 |
Statements
Selection of the optimum uniform partition search (English)
0 references
1986
0 references
Given an ordered list of records stored on a tape, the binary search minimizes the number of comparisons whereas the sequential search minimizes the distance traveled by the read head. This paper finds the optimum search which minimizes both the number of comparisons and the amount of travel.
0 references
number of comparisons
0 references
amount of travel
0 references
0.8274973034858704
0 references
0.7460166215896606
0 references
0.7444643974304199
0 references
0.7414637804031372
0 references
