编辑代码

#include <stdio.h>

int binarySearch(int arr[], int left, int right, int target) {
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] < target)
            right = mid - 1;
        else if (arr[mid] > target)
            left = mid + 1;
        else
            return mid;
    }
    
    return -1;
}

int main() {
    int arr[] = {85, 63, 52, 34, 25, 17, 6};
    int n = sizeof(arr) / sizeof(arr[0]);
    int target = 6;
    int result = binarySearch(arr, 0, n - 1, target);
    printf("%d ", result);

    return 0;
}