编辑代码

#include <stdio.h>

int binarySearch(int arr[], int low, int high, int x) {
    if (high >= low) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == x)
            return mid;
        if (arr[mid] > x)
            return binarySearch(arr, mid + 1, high, x);
        return binarySearch(arr, low, mid - 1, x);
    }
    return -1;
}

int main() {
    int arr[] = {85, 63, 52, 34, 25, 17, 6};
    int n = sizeof(arr) / sizeof(arr[0]);
    int x = 6;
    int result = binarySearch(arr, 0, n - 1, x);
    if (result == -1)
        printf("元素不存在数组中");
    else
        printf("元素存在数组中索引 %d", result);
    return 0;
}