BINARY SEARCH ON A TAPE.

Research output: Contribution to journalArticle

8 Citations (Scopus)

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
StatePublished - Jun 1987
Externally publishedYes

Fingerprint

Binary search
Binary trees
Binary Tree
Tapes
Minimise
Costs
Arbitrary
Movement

ASJC Scopus subject areas

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

Cite this

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

In: SIAM Journal on Computing, Vol. 16, No. 3, 06.1987, p. 573-590.

Research output: Contribution to journalArticle

Hu, TC & Galloway, ML 1987, 'BINARY SEARCH ON A TAPE.', SIAM Journal on Computing, vol. 16, no. 3, pp. 573-590.
Hu, T. C. ; Galloway, Michelle L. / BINARY SEARCH ON A TAPE. In: SIAM Journal on Computing. 1987 ; Vol. 16, No. 3. pp. 573-590.
@article{626862402fd84bfb8f2ba45c5a25d5e0,
title = "BINARY SEARCH ON A TAPE.",
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.",
author = "Hu, {T. C.} and Galloway, {Michelle L}",
year = "1987",
month = "6",
language = "English (US)",
volume = "16",
pages = "573--590",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

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

VL - 16

SP - 573

EP - 590

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -