import java.util.Arrays;  // for Arrays.toString()

/**
 * Demonstration of the classic Binary Search
 * @author Hyrum D. Carroll
 * @version 0.2 (May 4, 2020)
 */
public class BinarySearch{

    /**
     * Binary search - recursively looks for an item in a sorted array by
     * reducing the search space to half the previous search space.
     * @param a SORTED array
     * @param item The search key
     * @return true is item is in a, false otherwise
     */
    public static boolean binarySearch( int[] a, int item ){







    }


    public static void main( String[] args ){
        int[] array1 = {0,1,2,3,4,6,8,9};
        int[] array2 = {0,0,1,2,3,3,4,6,8,9};

        int search = 3;
        int[] array = array1;
        boolean result = false;

        search = 3;
        array = array1;
        result = binarySearch( array, search );
        System.out.println( "binarySearch( array="+Arrays.toString(array)+", search="+search+" ) returns "+result);

        search = 7;
        array = array1;
        result = binarySearch( array, search );
        System.out.println( "binarySearch( array="+Arrays.toString(array)+", search="+search+" ) returns "+result);

        search = 3;
        array = array2;
        result = binarySearch( array, search );
        System.out.println( "binarySearch( array="+Arrays.toString(array)+", search="+search+" ) returns "+result);
    }
}