如何创建一个循环来实现递归二进制搜索来搜索数组中的n个数字？JAVA

public class BinarySearch {
    public static int recursiveBinarySearch(int[] array, int target, int start, int end) {
        if (start > end) {
            return -1;
        }

        int middle = (start + end) / 2;

        if (array[middle] == target) {
            return middle;
        } else if (array[middle] > target) {
            return recursiveBinarySearch(array, target, start, middle - 1);
        } else {
            return recursiveBinarySearch(array, target, middle + 1, end);
        }
    }

    public static void main(String[] args) {
        int[] array = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int target = 8;
        int result = recursiveBinarySearch(array, target, 0, array.length - 1);

        if (result == -1) {
            System.out.println("Target not found in the array.");
        } else {
            System.out.println("Target found at index " + result + ".");
        }
    }
}