(algorithm)
Definition: A heuristic that keeps the elements of a list ordered by number of times each element is the target of a search.
See also self-organizing heuristic, self-organizing list.
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:03 2006.
Cite this as:
Paul E. Black, "frequency count 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/frequencyCountHueristic.html