[kdeighan]

okay i got the base case down, but i don't think i called the recursive method correctly at all.

Code:

  public double findLargest(myArray)
  {
        
        if( k == 0)
        {
            maximum = doubs[k];
            return maximum;
        }
        else return (myArray.findLargest(k-1)
   }