Uniform binary search: Difference between revisions

Revision as of 03:42, 21 September 2017

Revision as of 05:27, 20 February 2018

Line 1:

{{Orphan|date=February 2009}}

'''Uniform binary search''' is an optimization of the classic [[binary search]] algorithm invented by [[Donald Knuth]] and given in Knuth's ''[[The Art of Computer Programming]]''. It uses a [[lookup table]] to update a single array index, rather than taking the midpoint of an upper and a lower bound on each iteration; therefore, it is optimized for architectures (such as Knuth's [[MIX]]) on which