#include <stdio.h>
int binarysearch(int a[], int low, int high, int x)
{
int mid;
if (low > high)
return -1;
else
{
mid = (low + high) / 2;
if (x == a[mid])
return mid;
else if (x < a[mid])
return binarysearch(a, low, mid-1, x);
else
return binarysearch(a, mid+1, high, x);
}
}
int main (void)
{
int a[10] = {5, 12, 16, 24, 36, 56, 67, 68, 70, 88};
int j = 0;
int x = 24;
j = binarysearch(a, 0, 9, x);
if (j < 0)
printf("%d is not exist\n", x);
else
printf("%d is the number %d\n", x, (j+1));
return 0;
}