A Modified List Technique Allowing Binary Search

Authors:
G. Berman;A. W. Collin
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada;Department of Computer Science, University of Calgary, Calgary, Alberta, Canada
Venue:
Journal of the ACM (JACM)
Year:
1974

Citing 5
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimizing binary trees grown with a sorting algorithm

Communications of the ACM
Randomized binary searching with tree structures

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM

The use of normal multiplication tables for information storage and retrieval

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

A modification of linked lists is presented which permits searching almost as efficiently as a pure binary search. The method depends on using consecutive memory locations for consecutive list elements whenever possible.