Simulations of dynamic sequential search algorithms

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.