(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 Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Andrew Boniface, "worst-case minimum access", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/worstCaseMinimumAccess.html