@@ -0,0 +1,1062 @@
+package me.alivecode.algs4;%0A%0Aimport edu.princeton.cs.algs4.StdIn;%0Aimport edu.princeton.cs.algs4.StdOut;%0Aimport edu.princeton.cs.algs4.In;%0A%0Aimport java.util.Arrays;%0A%0Apublic class BinarySearch%7B%0A    %0A    private BinarySearch() %7B%7D%0A%0A    public static int indexOf(int%5B%5D arr, int key) %7B%0A        int lo = 0;%0A        int hi = arr.length - 1;%0A%0A        while(lo %3C= hi) %7B%0A            int mid = lo + (hi - lo) / 2;%0A            if (key %3C arr%5Bmid%5D) %7B hi = mid - 1; %7D%0A            else if (key %3E arr%5Bmid%5D) %7B lo = mid + 1; %7D%0A            else return mid;%0A        %7D%0A        return -1;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A%0A        // read the integers from a file%0A        In in = new In(args%5B0%5D);%0A        int%5B%5D whitelist = in.readAllInts();%0A%0A        // sort the array%0A        Arrays.sort(whitelist);%0A%0A        // read integer key from standard input; print if not in whitelist%0A        while (!StdIn.isEmpty()) %7B%0A            int key = StdIn.readInt();%0A            if (BinarySearch.indexOf(whitelist, key) == -1)%0A                StdOut.println(key);%0A        %7D%0A    %7D%0A%0A%7D%0A%0A

Add binary search algorithm.