I know this is easy.... but

Question

i dont really understand recursion all that well.
Im not sure but i think that im correct about setting largest to 0, and i gotta create a base state using an if statement correct?
And then following else statements to index through the array?
Is this the right course of action regarding the code i posted below. (maxValue method)
public class Lab10
    public static void main(String[] args)
        int[] a = {35, 49, 3, 35, 49, 9, 12, 35, 49, 12, 30, 50, 67, 78};
        print(a);
        int largest = maxValue(a,0,a.length);
        System.out.println("The largest value in the array is "+ largest);
    private static void print(int[] list)
        for(int i = 0; i < list.length; i++)
            System.out.print(list[i] + " ");
            if ((i+1)%10==0) System.out.println();
        System.out.println();
    public static int maxValue(int[] list, int startIndex, int endIndex)
        int largest = 0;
        if(     ){
        else{
}

Answer 1

I didnt quite understand what u told me before.
Recursion is all about the method calling itself right? i kinda took this approach but its not eaxctly doing the job. Can u tell where it went wrong?
public static int maxValue(int[] list, int startIndex, int endIndex)
        if ( startIndex <= 1 ) {
            return list[0];
        else if ( list[startIndex-1] > maxValue( list, startIndex-1, endIndex ) ) {
            return list[startIndex-1];
        else {
            return maxValue( list, startIndex-1, endIndex );
    }