binary search iterative
// Binary Search using Iterative Approach import java.io.*; class Binary_Search { public static void main(String[] args) throws Exception { Binary_Search obj = new Binary_Search(); InputStreamReader isr = new InputStreamReader(System.in); BufferedReader br = new BufferedReader(isr); System.out.println("Insert the length of the Array : "); int n = Integer.parseInt(br.readLine()); int arr[] = new int[n]; System.out.println("Insert elements into the array : "); for(int i=0;i<n;i++) { arr[i] = Integer.parseInt(br.readLine()); } System.out.println("Enter the num which you want to Search : "); int num = Integer.parseInt(br.readLine()); obj.logic(arr,num); } void logic(int arr[],int num) { int r = arr.length - 1; int l = 0; int mid; while(l<=r) { mid = l + (r-l)/2; if(arr[mid] == num) { System.out.println("Number found at "+mid+"th index"); break; } else if(arr[mid]>num) { r = mid - 1; } else { l = mid + 1; } } } }