二分查找1115

int Search(int a[],int n,int x)
{
    int i=0,low,high,mid;
    low=0;
    high=n-1;
    do
    {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
        if(a[mid]<x) low=mid+1;
        if(mid==x) return mid;
    }while(low<=high);
    return -1;
}