Uniform binary search: Difference between revisions

Revision as of 15:57, 2 July 2020

Revision as of 15:58, 2 July 2020

Line 16:

int power = 1;

int i = 0;

do {

int half = power;

Line 45 ⟶ 46:

/* Example of use: */

#define N 10

int main(void)

{

Line 53 ⟶ 55:

for (int i = 0; i < 20; ++i)

printf("%d is at index %d\n", i, unisearch(a, i));

return 0;

}