. . . . . "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 \n* a table lookup is generally faster than an addition and a shift, and \n* many searches will be performed on the same array, or on several arrays of the same length"@en . . . . . "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 \n* a table lookup is generally faster than an addition and a shift, and \n* many searches will be performed on the same array, or on several arrays of the same length"@en . . "2257"^^ . . . . . . . . . . . "4004215"^^ . . . "Uniform binary search"@en . . . . . "969434609"^^ . . . . . . . . . .