寻找最大数的递归

public int findMax(int[] arr){
     int max = process(arr,0,arr.length-1);
     return max;
}
public int process(int[] arr,int L,int R){
    if(L==R){
    return arr[L];
    }
    int M = L + ((R-L)>>1);
    int LMax = process(arr,L,M);
    int RMax = process(arr,M+1,R);
    return Math.max(LMax,RMax);
}