Write a JAVA program to search for an element in a given list of elements using binary search mechanism.

 import java.util.Scanner;

import java.util.Arrays;

public class BinarySearchExample {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        // Taking input

        System.out.print("Enter number of elements: ");

        int n = scanner.nextInt();

        int[] arr = new int[n];

        System.out.println("Enter " + n + " sorted elements:");

        for (int i = 0; i < n; i++) {

            arr[i] = scanner.nextInt();

        }

        System.out.print("Enter element to search: ");

        int key = scanner.nextInt();

        // Binary search logic

        int low = 0, high = n - 1;

        boolean found = false;

        int mid = -1;

        while (low <= high) {

            mid = (low + high) / 2;

            if (arr[mid] == key) {

                found = true;

                break;

            } else if (arr[mid] < key) {

                low = mid + 1;

            } else {

                high = mid - 1;

            }

        }

        if (found) {

            System.out.println("Element " + key + " found at index " + mid);

        } else {

            System.out.println("Element " + key + " not found in the list.");

        }

        scanner.close();

    }

}

Output: