Binarysearch.java

public class Binarysearch {
    public static  int  binarysearch(int arr[] , int search_element)  {
        int left = 0;
        int right = arr.length -1;
        int step=0;
        while(left <= right) {
            step++;
            int mid = (left+right)/2;
            if (arr[mid] == search_element ) {
                System.out.println(step);
                return mid;
            }
            else if(arr[mid] > search_element ) {
                right = mid-1;
            }
            else{
                 left = mid+1;
            }
        }
        System.out.println(step);
        return -1;
    }
    public static void main(String[] args) {
        int num[] = {3,5,6,7,8,9,33,54};
        int item = 54;
        int index = binarysearch(num,item);
        if (index != -1) {
            System.out.println("tne location of element is"+index);
        }
        else{
            System.out.println("Element not found");
        }
        
    }
}