BINARY SEARCH ON A TAPE.

Research output: Contribution to journalArticle

8 Scopus citations

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 languageEnglish (US)
Pages (from-to)573-590
Number of pages18
JournalSIAM Journal on Computing
Volume16
Issue number3
DOIs
StatePublished - Jan 1 1987
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'BINARY SEARCH ON A TAPE.'. Together they form a unique fingerprint.

  • Cite this