编辑代码

#include <stdio.h>

int BinarySearch(int arr[], int left, int right, int key) {
    while (left <= right) {
        int mid = left + (right - left) / 2;
        
        if (arr[mid] == key)
            return mid; // 元素存在，返回1
        
        if (arr[mid] > key)
            left = mid + 1;
        else
            right = mid - 1;
    }
    return -1; // 元素不存在，返回0
}

int main() {
    int arr[] = {85, 63, 52, 34, 25, 17, 6};
    int n = sizeof(arr) / sizeof(arr[0]);
    int key = 6;
    
    int result = BinarySearch(arr, 0, n - 1, key);
    
    if (result == -1)
        printf("元素%d不存在\n", key);
    else
        printf("元素%d在数组的第%d个位置\n", key, result+1);
    return 0;
}