import java.util.*;

class Find10 
// Linear search of an array (recursive) (timed, no display)
{
 public static void main(String[] args) throws Exception
 {
  Random rand = new Random();
  boolean b;
  long time1,time2;
  Scanner input = new Scanner(System.in);
  System.out.print("Enter the number of numbers: ");
  int num = input.nextInt();
  System.out.print("Enter the highest number: ");
  int high = input.nextInt();
  Integer[] a = new Integer[num];
  for(int i=0; i<num; i++)
      a[i]=rand.nextInt(high);
  System.out.print("Enter a number to search for: ");
  int n = input.nextInt();
  time1 = new Date().getTime();
  b = search(a,n);
  time2 = new Date().getTime();
  System.out.println("Time taken to search: "+(time2-time1)+"ms");
  if(b)
      System.out.println(n+" is in the array");
  else
      System.out.println(n+" is NOT in the array");
 }

 public static boolean search(Integer[] a,Integer n)
 {
  return search(a,n,0);
 }

 private static boolean search(Integer[] a,Integer n,int pos)
 {
  if(pos>=a.length)
     return false;
  else if(a[pos].equals(n))
     return true;
  else
     return search(a,n,pos+1);
 }


}