(definition)
Definition: A figure of merit for a family of searches, the "best" is the search that takes the minimum accesses in the worst case.
Author: AB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Andrew Boniface, "worst-case minimum access", 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/worstCaseMinimumAccess.html