void rec_maxmin(int a[],int i, int j, int amax, int amin)
{
if(i==j){
   amax = a[i];
   amin = a[i];
}
if(i==j-1)
{
   amax = cmax(a[i],a[j]);
   amin = cmin(a[i],a[j]);
}else{
   int mid = (i+j)/2;
   rec_maxmin(a,i,mid,lmax,lmin);
   rec_maxmin(a,mid+1,j,rmax,rmin);
   amax = cmax(lmax,rmax);
   amin = cmin(lmin,rmin);
}
请问一下这个递归过程是怎么实现的

#include <stdio.h>  
void rec_maxmin(int a[],int i, int j, int *amax, int *amin)
{
 int rmax,rmin,lmax,lmin,mid;
 if(i==j)
  {
   *amax = a[i];
   *amin = a[i];
  }
  else if(i==j-1)
        {
         *amax = a[i]>a[j]?a[i]:a[j];
         *amin = a[i]<a[j]?a[i]:a[j];
       }
       else
       {
          mid = (i+j)/2;
          rec_maxmin(a,i,mid,&lmax,&lmin);
          rec_maxmin(a,mid+1,j,&rmax,&rmin);
          *amax = lmax>rmax?lmax:rmax;
          *amin = lmin<rmin?lmin:rmin;
       }
}
int main()
{  int a[10]={8,23,5,76,2,13,46,56,32,19},max,min;
   rec_maxmin(a,0,9,&max,&min);
   printf("max=%d,min=%d\n",max,min);
 }
根据你的程序修改而成

谢谢啊，我再研究研究，我是新手，希望各位前辈予以指教，也希望能通过此论坛提高自己对编程的信心