Uniform binary search: Difference between revisions

Revision as of 06:13, 13 November 2010

Revision as of 16:59, 27 August 2011

Line 30:

while (1) {

if (key == a[i]) return i;{

else if (delta[d] == 0) return -1i;

} else if (delta[d] == 0) {

if (key < a[i]) ireturn -= delta[++d]1;

} else i += delta[++d];{

if (key < a[i]) {

i -= delta[++d];

} else {

i += delta[++d];

}

}

}