/*This is the solution to the first problem. Here we generated a random array and
  found out the min value using recursion */
import java.util.Random;

public class recurmin{

public static void build_array(int[] A)
{
	int i,value;

        Random rand = new Random();

        for(i=0;i<A.length;i++)
        {
		value = rand.nextInt();
                value = Math.abs(value);
                value = value%1000;
                A[i] = value;
        }
}


public static int findmin(int[] A,int i,int j)
{
	int min,lmin,rmin,mid;

        System.out.println("the values of i and j are "+i+"  "+j);
        
        if(i==j)
            {min=A[i];return min;}

        else
        {
	    mid=(i+j)/2;

            lmin=findmin(A,i,mid);
            rmin=findmin(A,mid+1,j);

            if(lmin <= rmin)
                 return lmin;
            else
                 return rmin;
        }

}    
	
	 	           
public static void main(String args[])
{
	int i,min,length;
                
        length = Integer.parseInt(args[0]);
        int []A = new int[length];
        
        build_array(A);
      
        System.out.println("The array generated is as follows");

        for(i=0;i<length;i++)
            System.out.print(A[i]+"  ");

        System.out.println(); 

        min=findmin(A,0,length-1);

        System.out.println("The minimum value of the array is  "+min);

}          
}