二分查找

/*二分查找的前提是数组元素为有序的*/#include"stdio.h"int main(){    int a[10];    int low,high,middle;    int x;    int i;    for(i=0;i<=9;i++)        scanf("%d",&a[i]);    printf("Give x:");    scanf("%d",&x);    low=0;high=9;    while(low<=high){        middle=(low+high)/2;        if(a[middle]==x)            break;        else if(x>a[middle])            low=middle+1;        else            high=middle-1;    }    if(low<=high)        printf("x is founded!\n");    else        printf("x is not founded!\n");    return 0;}