(algorithm)
Definition: A heuristic that moves the target of a search to the head of a list so it is found faster next time.
See also move-to-root heuristic, transpose sequential search, self-organizing list.
Note: This technique speeds up linear search performance only if the target item is likely to be searched for again soon.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:05 2006.
Cite this as:
Paul E. Black, "move-to-front heuristic", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/movefront.html
