Write a program to search for an ITEM using binary search in array X[10].

import java.util.Scanner;

public class KboatBinarySearch
{
    public static void main(String args[]){
        Scanner in = new Scanner(System.in);
    
        int X[] = new int[10];
        
        System.out.println("Enter array in ascending order : ");
        for(int i = 0; i < 10; i++)  
        {   
            X[i] = in.nextInt();      
        }
        
        System.out.println("Input Array is:");
        for (int i = 0; i < 10; i++) {
            System.out.print(X[i] + " ");
        }
        System.out.println();
        
        System.out.println("Enter search item :" );
        int item = in.nextInt();
        
        int l = 0, h = 9, index = -1;
        while (l <= h) {
            int m = (l + h) / 2;
            if (X[m] < item)
                l = m + 1;
            else if (X[m] > item)
                h = m - 1;
            else {
                index = m;
                break;
            }
                
        }
        
        if (index == -1) {
            System.out.println("Search item not found");
        }
        else {
            System.out.println(item + " found at index " + index);
        }
    }
}