### Abstract

Given n records stored alphabetically on a tape, any comparison search procedure can be characterized by a binary tree. The complete binary tree (binary search) uses the minimum number of comparisons but not the minimum number of movements. The linear binary tree (sequential search) uses the minimum number of movements but not the minimum number of comparisons. A tape-optimal tree is a tree which minimizes the total cost of comparisons and movements. The tape-optimal tree is a 'hybrid' of the linear tree and the complete binary tree, and is characterized for arbitrary n.

Original language | English (US) |
---|---|

Pages (from-to) | 573-590 |

Number of pages | 18 |

Journal | SIAM Journal on Computing |

Volume | 16 |

Issue number | 3 |

State | Published - Jun 1987 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*16*(3), 573-590.

**BINARY SEARCH ON A TAPE.** / Hu, T. C.; Galloway, Michelle L.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 16, no. 3, pp. 573-590.

}

TY - JOUR

T1 - BINARY SEARCH ON A TAPE.

AU - Hu, T. C.

AU - Galloway, Michelle L

PY - 1987/6

Y1 - 1987/6

N2 - Given n records stored alphabetically on a tape, any comparison search procedure can be characterized by a binary tree. The complete binary tree (binary search) uses the minimum number of comparisons but not the minimum number of movements. The linear binary tree (sequential search) uses the minimum number of movements but not the minimum number of comparisons. A tape-optimal tree is a tree which minimizes the total cost of comparisons and movements. The tape-optimal tree is a 'hybrid' of the linear tree and the complete binary tree, and is characterized for arbitrary n.

AB - Given n records stored alphabetically on a tape, any comparison search procedure can be characterized by a binary tree. The complete binary tree (binary search) uses the minimum number of comparisons but not the minimum number of movements. The linear binary tree (sequential search) uses the minimum number of movements but not the minimum number of comparisons. A tape-optimal tree is a tree which minimizes the total cost of comparisons and movements. The tape-optimal tree is a 'hybrid' of the linear tree and the complete binary tree, and is characterized for arbitrary n.

UR - http://www.scopus.com/inward/record.url?scp=0023362891&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023362891&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0023362891

VL - 16

SP - 573

EP - 590

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -