Revision as of 11:54, 25 July 2020 edit WOSlinker (talk \| contribs) Administrators 861,415 edits m change source to syntaxhighlight ← Previous edit		Latest revision as of 10:09, 9 January 2024 edit undo Onel5969 (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers 992,417 edits m Disambiguating links to Mix (link changed to MIX (abstract machine)) using DisamAssist.
Line 1: '''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 (abstract machine)\|MIX]]) on which *a table lookup is generally faster than an addition and a shift, and

Uniform binary search: Difference between revisions