BinarySearchDemoClass.java

public class BinarySearchDemoClass {
    public static int binarySearch(String[] array, String value) {
        int l = 0, r = array.length;

        int mid = (l + r) / 2;
        while (l < r) {
            if (value.compareTo(array[mid]) == 0) {
                return mid;
            } else if (value.compareTo(array[mid]) > 0) {
                l = mid;
            } else {
            	r = mid;
            }

        	mid = (l + r) / 2;
        }
        return -1;
    }
}