Java 递归求数组最大值

package suanfa;public class recursionMax {public static int findMax(int[] array,int from){          if(from == array.length-1){              return array[from];          }          return Math.max(array[from], findMax(array,from+1));      }                  public static void main(String[] args) {            int[] a = { 855, 38, 65, 97, 76, 13, 27,56, 48, 89, 852 };          System.out.println(findMax(a,0));      }  }