binarysearch

binarysearch

#include<stdio.h>
int binarysearch(int x,int v[],int n)
{
        int low,high,mid;
        low=0;
        high=n-1;

        while(low <= high){
                mid = low + high / 2;
                if ( x < v[mid])
                        high = mid - 1;
                else if ( x > v[mid])
                        low = mid - 1;
                else
                        return mid;
        }
        return -1;
}

main(){
 int digits[21] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
 int result=0;
 int x=5;
 result = binarysearch(x,digits,21);
 printf("the %d position is in %d",x,result);
}