如何将用户输入添加到此代码并使用递归算法进行搜索?

How do I add user input to this code and search using recursive algorithm?

我想获取用户的输入并搜索索引。

谁能帮我做一下?我们将不胜感激。谢谢。

public class Main {

    int[] array = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30};

    public int binarySearch(int key, int l, int r) {
        if (r < l) {
            return -1;
        }
        int mid = (l + r) / 2;
        if (key == array[mid]) {
            return mid;
        }
        if (key < array[mid]) {
            return binarySearch(key, l, mid - 1);
        } else {
            return binarySearch(key, mid + 1, r);
        }

    }

    public static void main(String[] args) {
        Main b = new Main();

        for (int i = 2; i < 32; i += 2) {

            System.out.println("Search for element " + i);
            System.out.println("This element is found at " + b.binarySearch(i, 0, 14));
            System.out.println("=======+============+=======+==============");
        }
    }
}

您可以使用 Scanner class

获取用户输入
int input;
Scanner sc=new Scanner(System.in);
input=sc.nextInt();

然后将此输入传递给您的 binarySearch() 方法

import java.util.Scanner;


public class Main {
    int[] array = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30};

    public int binarySearch(int key, int l, int r) {
        if (r < l) {
            return -1;
        }
        int mid = (l + r) / 2;
        if (key == array[mid]) {
            return mid;
        }
        if (key < array[mid]) {
            return binarySearch(key, l, mid - 1);
        } else {
            return binarySearch(key, mid + 1, r);
        }

    }

    public static void main(String[] args) {
        Main b = new Main();
        System.out.println("input the element you want to search :");
        Scanner in = new Scanner(System.in);
        int i = in.nextInt();
        System.out.println("Search for element " + i);
        System.out.println("This element is found at " + b.binarySearch(i, 0, 14));
        System.out.println("=======+============+=======+==============");
        in.close();
    }
}