编辑代码

#include <stdio.h>

int binarySearch(int arr[], int length, int k) {
    int left = 0;
    int right = length - 1;

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

    return -1;
}

int main() {
    int arr[] = {85, 63, 52, 34, 25, 17, 6};
    int length = sizeof(arr) / sizeof(arr[0]);
    int k = 6;

    int index = binarySearch(arr, length, k);
    if (index != -1) {
        printf("元素 %d 在数组中的位置是 %d\n", k, index);
    } else {
        printf("元素 %d 不在数组中\n", k);
    }

    return 0;
}