Binary Search

public class BinarySearch {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int arr[] ={2,3,4,10,40};
		int element_To_Search = 400;
		int len = arr.length;
		
		
		System.out.println("Searching for the element :: "+element_To_Search);
		int indexFound = binarySearch(arr,0,len-1,element_To_Search);

		if(indexFound==-1)
			System.out.println("Element not found::");
		else
			System.out.println("Element found at index ::"+indexFound);
	}

	public static int binarySearch(int [] arr, int startIndex, int endIndex, int elementToSearch){
		if(endIndex>=startIndex){
			int mid = (endIndex+startIndex)/2;
			
			if(arr[mid]==elementToSearch)
				return mid;
			
			if(arr[mid]>elementToSearch)
				return binarySearch(arr,startIndex,mid,elementToSearch);
			else
				return binarySearch(arr,mid+1,endIndex,elementToSearch);
			
		}
		
		return -1;
	}
}

Searching for the element :: 40
Element found at index ::4