Thumbnail
Access Restriction
Subscribed

Author Price, C. E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1971
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Consideration is given to the basic methodology for table searching in computer programming. Only static tables are treated, but references are made to techniques for handling dynamic tables. Methods described are: sequential search, merge search, binary search, estimated entry, and direct entry. The rationale of key transformation is discussed, with some consideration of methods of “hash addressing.” A general guide to technique selection is given in conclusion.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1971-06-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 3
Issue Number 2
Page Count 16
Starting Page 49
Ending Page 64


Open content in new tab

   Open content in new tab
Source: ACM Digital Library