Uniform binary search: Difference between revisions

Content deleted Content added
Addbot (talk | contribs)
m Bot: Adding Orphan Tag (Report Errors)
m link lookup table using Find link
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
 
*a table lookup is generally faster than an addition and a shift, and