Self-adjusting binary search trees
Journal of the ACM (JACM)
Data structures in Pascal
Algorithms in C++
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Handbook of Algorithms
| Hi-index | 0.00 |
For a given searching problem, the particular choice of an algorithm and data structure depends on the nature of the storage medium (internal memory, disk, or other), on the nature of the data being organized (does it change through insertions or deletions, is it alphabetic or numeric, are some elements more likely to occur as search objects than others, and so on), and on the requirements of the search (must it be fast on average or in the worst case, how much information is available, and the like). We describe here some of the most important algorithms and data structures.