// recursive find max

// ax[n] is an array of integer

ax[10];

max(a,b){
  if ( a > b ) return a;
  else return b;
}

findmax(m,index){
  if( index < 1 ) 
    return max(m,ax[0]);
  else
    return max(m,findmax(ax[index],index-1));
} 
 
init(){
  i = 0;
  while( i < 10 ){
    ax[i] =  20 - i;
    i = i + 1;
  }
}
 
prax(){
  i = 0;
  while( i < 10 ){
    print(ax[i]," ");
    i = i + 1;
  }
}
  
main(){
//  print(max(10,20));
  init();
  prax();
  print(" --> ",findmax(ax[9],8));
}
