(algorithm)
Definition: Search an array or list by checking items one at a time. If the value is found, swap it with its predecessor so it is found faster next time.
Also known as self-organizing sequential search.
See also linear search, move-to-front heuristic, self-organizing list.
Note: This moves more frequently searched items to the front. If a few items are sought much more often than the rest, this can save time. A binary search or hash table is almost always faster, though.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 30 September 2009.
HTML page formatted Wed Sep 30 13:22:29 2009.
Cite this as:
Paul E. Black, "transpose sequential search", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 30 September 2009. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/transposeSeqSearch.html
