04-02遞歸與循環關系_重寫代碼

重寫代碼

請觀察如下循環，請把它改為遞歸的方式。

int[] a = {3,5,2,8,16,3,9,17};

int max = a[0];
for(int i=1; i if(a[i]>max) max = a[i];

System.out.println(max);

public class MyA
{
	static int f(int[] a, int n)
	{
		if(n==0) return a[0];
		
		int t = f(a,n-1);
		return t > a[n] ? t : a[n];
	}
	
	public static void main(String[] args)
	{
		int[] a = {3,5,2,8,29,16,3,9,17};
		
		System.out.println(f(a,a.length-1));
	}
}