Jump to content

Uniform binary search

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by GTBacchus (talk | contribs) at 02:50, 27 September 2006 (dab link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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
  • many searches will be performed on the same array, or on several arrays of the same length

References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Uniform_binary_search&oldid=78031336"