I'm an idiot. Need Recursion assistance.

Question

I need help writing a simple program that finds the largest value in an array using recursion (yes, an assignment. Simple one at that). Can anyone point me in the right direction? My teacher is of no help at all.

Answer 1

public class LargeTest
     public static void main(String[] args)
          LargeArray thelarge = new LargeArray();
          System.out.println(thelarge.getLarge(0));
public class LargeArray
     public int n;
     public int[] a;
     public int large;
     public LargeArray()
          n = 0;
          int[] a = { 2, 3, 9, 7, 5 };
          int large;
     public int getLarge(int n)
          if (a[n + 1] < a[n])
               large = a[n];
          if ((n + 1) < a.length)
               getLarge(n + 1);
          return large;
Sorry, still an idiot. This code compiles, but doesn't run. This is the jGRASP error:
----jGRASP exec: java LargeTest
java.lang.NullPointerException
     at LargeArray.getLarge(LargeArray.java:17)
     at LargeTest.main(LargeTest.java:8)
Exception in thread "main"
----jGRASP wedge2: exit code for process is 1.
----jGRASP: operation complete.