BinarySearch.java

package Arrays;

public class BinarySearch {
	public static void main(String[] args) {
		int []a= {10,23,43,49,67,92};

		int find=2;
		int start=0;
		int end=a.length-1;
		
		
		while(start<=end) {
			int mid=(start+end)/2;
			if(a[mid]==find)
			{
				System.out.println("Element Found At Index"+mid+"");
				break;
			}
			else if(find>a[mid]) {
			  start=mid+1;  
			}
			else if(find<a[mid]) {
				end=mid-1;
			}
			else {
			mid=start+end/2;
			
		}
	if(end<start) {
		System.out.println("Element Not Found");
	}
		
	}

}
}