如何用递归就数组中的最大数

[HaiYang2006]

static void Main(string[] args)
{
int []a = {11,3,6,20,5,9};

int ok = test(a);

Console.WriteLine(ok);



}



public static int test(int []num)
{ int x=0;
int log = num.Length;

for(int t=0;t<log;t++){
if(num[t]>x)
{
x=num[t];

}

}

return x;
}

如何改一下？

[HaiYang2006]

各位　，帮忙啊！

[HaiYang2006]

各位　，帮忙啊！

[Apq001]

public static int test(int []num, int x,int index)
{
if( index >= num.Length - 1 || x > num[index] )return x;

return test( num, x, index+1 );
}

[Apq001]

public static int test(int []num, int x,int index)
{
if( index >= num.Length - 1 || x > num[index] )return x;

return test( num, num[index], index+1 );
}

[Apq001]

不对，再改过,这个没问题了：
public static int test(int []num, int x,int index)
{
if( index >= num.Length )return x;

return test( num, num[index] > x ? num[index] : x, index+1 );
}

[bobo0124]

public static int test(int []num,int start)
{
if( start == 0)
{
return num[0];
}
int a= num[start];
int b= test(num,start-1);
return a>=b?a:b;
}
static void Main(string[] args)
{
int []a = {11,3,6,20,5,9};
int ok = test(a,a.length-1);
Console.WriteLine(ok);
}

[huang_u]

public static int test(int []num)
{
int log = num.Length;
for(int x=0;x<log-1;x++)
{
for(int t=0;t<log-1;t++)
{
if(num[t]<num[t+1])
num[t]= num[t+1];
}


}
return num[0] ;
}

[HaiYang2006]

谢谢各位!