Aaron Tenenbaum
Abstract
In [3], R.L. Rivest presents a set of methods for dynamically reordering a sequential list containing N records in order to increase search efficiency. The method Ai (for i between 1 and N) performs the following operation each time that a record R has been successfully retrieved: Move R forward i positions in the list, or to the front of the list if it was in a position less than i. The method A1 is called the transposition method, and the method AN-1 is called the move-to-front method.
- 1 Bitner, J.R. Heuristics that dynamically alter data structures to decrease their access time. Ph.D. Th. I3. of Illinois at Urbana- Champaign, Ill., 1976, pp. 23-40. Google Scholar
Digital Library
- 2 Knuth, D.E. The Art of Computer Programming, Vol. 3; Sorting and Searching. Addison-Wesley, Reading, Mass., 1973, pp. 397-399. Google ScholarDigital Library
- 3 Rivest, R. On self-organizing sequential search heuristics. Comm. ACM 19, 2 (Feb. 1976), 63-67. Google ScholarDigital Library
Index Terms
- Simulations of dynamic sequential search algorithms
Recommendations
On self-organizing sequential search heuristics
This paper examines a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that each element is searched for with a fixed probability ...
Average binary search length for dense ordered lists
A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense—i.e. when records are in contiguous locations. It is easy to show that the maximum number of looks for a search L is given by [1]. L = [log2...
Dynamic memory allocation in computer simulation
e of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms ...
Comments