编辑代码

#include <stdio.h>

int binarySearch(int arr[], int n, int k) {
    int start = 0;
    int end = n - 1;

    while (start <= end) {
        int mid = (start + end) / 2;

        if (arr[mid] == k) {
            return mid;
        } else if (arr[mid] < k) {
            end = mid - 1;
        } else {
            start = mid + 1;
        }
    }

    return -1;
}

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

    int index = binarySearch(arr, n, k);

    if (index != -1) {
        printf("元素 %d 存在于数组中，索引为 %d\n", k, index);
    } else {
        printf("元素 %d 不存在于数组中\n", k);
    }

    return 0;
}