Consideration is given to basic methodology for table searching in computer programming. Only static tables are treated but references are given 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 indicated, and methods of "hash addressing" are referenced. A general guide to technique selection is given in conclusion.
展开▼
