Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Modified List Technique Allowing Binary Search

A Modified List Technique Allowing Binary Search A Modified List Technique Allowing Binary Search G. BERMAN University of Waterloo, Waterloo, Ontario, Canada AND A. W. COLIJN University of Calgary, Calgary, Alberta, Canada 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. KEYWOADSANDPHRASES: binary search, linked lists, sorting, file organization ca CATEGORIES: 3.74, 5.31 1. Introduction Linked lists [2] are useful in many situations in which the amount and structure of the infortnation are not accurately predictable. They have the disadvantage that the information can only be efficiently processed in a sequential manner, and that a search for a particular item has to be an inefficient linear search. Binary trees [1-3, 5], on the other hand, often allow efficient searching of the information, b u t they may not allow convenient or efficient sequential processing: for sequential processing, either recursion must be used or the tree must be threaded. I n this paper, a modified list technique is proposed which combines the advantages of linked lists with the possibility of efficient searching. I n this method, consecutive list elements are placed in http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

A Modified List Technique Allowing Binary Search

Berman, G.; Collin, A. W.
Journal of the ACM (JACM) , Volume 21 (2) – Apr 1, 1974
Download PDF
6 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-modified-list-technique-allowing-binary-search-fqwyD9VaBV

References (5)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1974 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/321812.321818
Publisher site
See Article on Publisher Site

Abstract

A Modified List Technique Allowing Binary Search G. BERMAN University of Waterloo, Waterloo, Ontario, Canada AND A. W. COLIJN University of Calgary, Calgary, Alberta, Canada 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. KEYWOADSANDPHRASES: binary search, linked lists, sorting, file organization ca CATEGORIES: 3.74, 5.31 1. Introduction Linked lists [2] are useful in many situations in which the amount and structure of the infortnation are not accurately predictable. They have the disadvantage that the information can only be efficiently processed in a sequential manner, and that a search for a particular item has to be an inefficient linear search. Binary trees [1-3, 5], on the other hand, often allow efficient searching of the information, b u t they may not allow convenient or efficient sequential processing: for sequential processing, either recursion must be used or the tree must be threaded. I n this paper, a modified list technique is proposed which combines the advantages of linked lists with the possibility of efficient searching. I n this method, consecutive list elements are placed in

Journal

Journal of the ACM (JACM) – Association for Computing Machinery

Published: Apr 1, 1974

There are no references for this article.