Binary Search

public class BinarySearch {

    static int search(int arr[], int el) {

        int l = 0;
        int h = arr.length - 1;

        while(l <= h){
            int mid = (l + h) / 2;
            if(arr[mid] == el){
                return mid + 1;
            }else if(el < arr[mid]){
                h = mid - 1;
            }else{
                l = mid + 1;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        System.out.println(search(new int[]{1, 2, 3, 4, 5}, 2));
        System.out.println(search(new int[]{1, 2, 3, 4, 5}, 0));
    }

}