递归方式求数组中最大元素

public class DiGuiMax {
	
	public static void main(String[] args)
	{
		int[] arr={11,3,5,8,35,66,12,44};
		int max = largest(arr,0,7);
		System.out.println(max);
	}
	
	public static int largest(int[] arr,int low,int high)
	{
		int max;
		if(arr[low]==arr[high])
			return arr[low];
		else
		{
			max = largest(arr,low+1,high);
			if(max<=arr[low])
				return arr[low];
			else
				return max;
		}
	}

}