编辑代码

#include <iostream>
#include <algorithm>	

int binarySearch(int arr[], int size, int k) {
	    std::sort(arr, arr + size); // 确保数组是有序的
	    int left = 0;
	    int right = size - 1;
	
	    while (left <= right) {
	        int mid = left + (right - left) / 2;
	
	        if (arr[mid] == k) {
            return mid;
	        } else if (arr[mid] < k) {
            left = mid + 1;
        } else {
            right = mid - 1;
	        }
    }	
        return -1; //没有找到元素
        	}	

	int main() 
    {
    int array[] = {85, 63, 52, 34, 25, 17, 6};
	    int size = sizeof(array) / sizeof(array[0]);
	    int key = 6;
        int result = binarySearch(array, size, key);
        if (result != -1) {
	        std::cout << "找到了元素" << key << "，它的下标是" << result << std::endl;
	    } else {
	        std::cout << "未找到元素" << key  << std::endl;
	    }

    return 0;
	}