BadBinarySearch2

public class BadBinarySearch {

    public static int rank(char key, char[] a) {
        int lo = 0;
        int hi = a.length - 1;
        while (lo <= hi) {
            // Key is in a[lo..hi] or not present.
            int mid = lo + (hi - lo) / 2;
            System.out.print("\t" + mid);
            if      (key < a[mid]) hi = mid - 1;
            else if (key > a[mid]) lo = mid + 1;
            else return mid;
        }
        return -1;
    }


        public static void main(String[] args) {
                char[] b = {'a','b','c','d','e'};
                System.out.println("Searching for " + 'd');
                int found = rank('d',b);
                System.out.println("\n\nFound at " + found + "\n");
        }

}