Uniform binary search
http://dbpedia.org/resource/Uniform_binary_search an entity of type: Software
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
rdf:langString
rdf:langString
Uniform binary search
xsd:integer
4004215
xsd:integer
969434609
rdf:langString
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
xsd:nonNegativeInteger
2257