插入排序递归算法

#include<iostream>#include<algorithm>#include<iterator>template <class T>void insert_sort_rec(T A[],int n){     int k;     T a;     n=n-1;     if(n>0){        insert_sort_rec(A,n);        a=A[n];        k=n-1;        while(k>=0&&A[k]>a){              A[k+1]=A[k];              k-=1;                                          }       A[k+1]=a;                  }      }using namespace std;int main(){    int a[]={1,4,2,3,1,7,3,8,4,1,0};    insert_sort_rec(a,sizeof(a)/sizeof(int));    copy(a,a+sizeof(a)/sizeof(int),ostream_iterator<int>(cout,"\t"));    system("pause");    }