// Name : Matthew Reeves 
// This is a test program for recursive methods

import java.util.Scanner;
import java.util.InputMismatchException;

public class MAV
{

	//main method for Recursion class
	public static void main (String args[])	
	{
		Scanner input=new Scanner(System.in);

		int array1[]={-203, 3, 5, 99, 300, 211, 77, 98, 0, 1};

		int array2[]={500, 430, 309, 265, 177, 108, 54, 32, 12, 0};

		int array3[]={123, 345, 456, -787, 24, 52, 81, 125, 256, 0};

		int numElements;

		System.out.println("\n------------------------------------------------------------------------------\n");		

		System.out.println("The contents of Array 1 are: \n");
		
		for (int x=0;x<array1.length;x++)
		{
			System.out.printf("%d   ",array1[x]);
		}

		numElements=array1.length-1;		
		
		System.out.printf("\n\nThe smallest value using recursion: %d\n", Recursion(array1, numElements));
		System.out.printf("\nThe smallest value using iteration: %d\n", Iteration(array1));
	
		System.out.println("\n------------------------------------------------------------------------------\n");		
		
		System.out.println("The contents of Array 2 are: \n");
		
		for (int x=0;x<array2.length;x++)
		{
			System.out.printf("%d   ",array2[x]);
		}

		numElements=array2.length-1;		
		
		System.out.printf("\n\nThe smallest value using recursion: %d\n", Recursion(array2, numElements));
		System.out.printf("\nThe smallest value using iteration: %d\n", Iteration(array2));
		
		System.out.println("\n------------------------------------------------------------------------------\n");		
	
		System.out.println("The contents of Array 3 are: \n");
		
		for (int x=0;x<array3.length;x++)
		{
			System.out.printf("%d   ",array3[x]);
		}

		numElements=array3.length-1;		
		
		System.out.printf("\n\nThe smallest value using recursion: %d\n", Recursion(array3, numElements));
		System.out.printf("\nThe smallest value using iteration: %d\n", Iteration(array3));
	}

	public static int Recursion(int arrayX[], int numElem)
	{
		if (numElem>0)
		{
			if (arrayX[numElem]<arrayX[numElem-1])
			{
				arrayX[numElem-1]=arrayX[numElem];
				numElem=numElem-1;
				Recursion(arrayX, numElem);
			}
			else
			{
				numElem=numElem-1;
				Recursion(arrayX, numElem);
			}
		}

		return arrayX[0];
	}

	public static int Iteration(int arrayX[])
	{
		int smallest=arrayX[0];	
	
		for (int count=1;count<arrayX.length;count++)
		{
			if (arrayX[count]<smallest)
			{
				smallest=arrayX[0];
			}
		}

		return smallest;
	}	
}