Uniform binary search
id:
uniform-binary-search-232-8425399
title:
Uniform binary search
text:
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 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 sam
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Uniform_binary_search
date created:
date modified:
2024-01-09T10:09:05Z
main entity:
{"identifier":"Q4925115","url":"https://www.wikidata.org/entity/Q4925115"}
image:
fields total:
13
integrity:
13