一个数组反序递归，

http://hi.baidu.com/ling_qian_mo/item/8fe8e248a3ab6bf9bdf45189

#include <iostream>using namespace std;//用递归输出数组的反序:antitone(反序)void ArrAntitone(int arr[],int n){     if(n == 1){         cout<<arr[n-1]<<endl;     }     else{         cout<<arr[n-1]<<" ";         ArrAntitone(arr,--n);     }}int _tmain(int argc, _TCHAR* argv[]){     int arr[20]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};     ArrAntitone(arr,20);     return 0;}