int binarySearch(const int *baseArray, int target)
{
    int left,right,middle;
    left=0;
    right= N - 1;
    while (left <= right) {
        middle= (left + right) / 2;
        if(baseArray[middle] < target) {
            left= middle + 1;
        }
        else if(baseArray[middle] > target) {
            right= middle - 1;
        } else {
            return middle;
        }
        printf("left=%d,middle=%d,right=%d\n",left,middle,right);//(debug)
    }
    return 0;
}
```[运行结果](https://img1.imgtp.com/2022/11/13/1ASXj98T.png)