This hyperlink will take you to the solution to the recursive binary search program. The file BinarySearch1.java is an algorithm that works on recursively smaller arrays. The file BinarySearch2.java is an algorithm that does not create array after array, but rather uses the same array over and over. BinarySearch2 is harder to write, but more efficient. Both are good examples of recursive programming.

If Binary Search is assigned as a lab or homework, the aforementioned code might be secured.

Link to Binary Search solutions.