Simulations of dynamic sequential search algorithms
- 1 September 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (9) , 790-791
- https://doi.org/10.1145/359588.359616
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 A i (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 A 1 is called the transposition method, and the method A N -1 is called the move-to-front method.Keywords
This publication has 1 reference indexed in Scilit:
- On self-organizing sequential search heuristicsCommunications of the ACM, 1976