二分查找算法

import java.util.Scanner;

public class BinarySearch {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        System.out.print("Enter the number to search: ");
        int x = input.nextInt();
        int result = binarySearch(arr, x);
        if (result == -1) {
            System.out.println("Number not found");
        } else {
            System.out.println("Number found at index "   result);
        }
    }

    public static int binarySearch(int[] arr, int x) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int mid = left   (right - left) / 2;
            if (arr[mid] == x) {
                return mid;
            } else if (arr[mid] < x) {
                left = mid   1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
}