严格递增序列二分查找算法

//严格递增序列二分查找算法
#include<cstdio>
int binarySearch(int A[],int left,int right,int x){
int mid
while(left+right){
    mid=(left+right)/2;
    if(A[mid]==x)return mid;
    else if(A[mid]>x){
        right=mid-1;
    }else{
        left=mid+1;
    }
}
return -1;
}
int main(){
    const int n=10;
    int A[n]={1,2,4,6,8,33,9,5,21,45};
    printf("%d %d\n",binarySearch(A,0,n-1,6),binarySearch(A,0,n-1,9));
}