Definition: A figure of merit for a family of searches, the "best" is the search that takes the minimum accesses in the worst case.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Andrew Boniface, "worst-case minimum access", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/worstCaseMinimumAccess.html