public class ArraySearch {

    public static void main (String[] argv)
    {
        // Fill an array with some random values - for testing.
        int[] testData = makeRandomArray (10);

        // A random search term.
        int searchTerm = UniformRandom.uniform (1, 100);

        // Call the recursive search method.
        boolean found = search (A, searchTerm, 0);

        System.out.println ("found=" + found);
    }


    static boolean search (int[] A, int value, int index)
    {
        // Two "bottom out" cases:
        if (index >= A.length) {
            return false;
        }
        if (A[index] == value) {
            return true;
        }

        // Else try further into the array:
        return search (A, value, index+1);
    }


    static int[] makeRandomArray (int length)
    {
        int[] A = new int [length];

	for (int i=0; i<A.length; i++) {
	    A[i] = UniformRandom.uniform (1, 100);
	}

        return A;
    }

}