二分查找算法

public static int binarySearchIterative(int[] array, int target) {
    int low = 0;
    int high = array.length - 1;
    while (low <= high) {
        int mid = low + (high - low) / 2;
        if (array[mid] == target) {
            return mid;
        } else if (array[mid] < target) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }
    return -1; // 如果未找到目标元素，返回-1
}

public static int binarySearchRecursive(int[] array, int target, int low, int high) {
    if (low <= high) {
        int mid = low + (high - low) / 2;
        if (array[mid] == target) {
            return mid;
        } else if (array[mid] < target) {
            return binarySearchRecursive(array, target, mid + 1, high);
        } else {
            return binarySearchRecursive(array, target, low, mid - 1);
        }
    }
    return -1; // 如果未找到目标元素，返回-1
}