Uniform binary search: Difference between revisions

Revision as of 15:52, 2 July 2020

Revision as of 15:57, 2 July 2020

Line 25:

int unisearch(int *a, int key)

{

int i = delta[0] - 1; /* midpoint of array */

int d = 0;

Line 47:

int main(void)

{

int i, a[N] = {1, 3, 5, 6, 7, 9, 14, 15, 17, 19};

make_delta(N);

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

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

return 0;