Recursively find the maximum value of an array

A line-writing test for HKUST News flight

I've never been familiar with recursion.

Title: The maximum value of a sequence, in the form of recursion;

public class Blanket{public static void Main (string[] args) {int[] a = {1,9,2,5,3,7,4,6,12,435,67,23,232,564564,5};int ma X1 = max (a,0,0); System.out.println (MAX1);//return max1;} public static int Max (int[] a,int index,int max) {if (index = = a.length) return Max;max = Math.max (max, A[index]); Index++;ret Urn Max (A,index,max);}}

It was a blind write, I didn't think I could. Flattered. Ask the big guy to teach you where you can change.

Recursively find the maximum value of an array