C++插入排序模板

#include <iostream>using namespace std;template <typename T> void InsertSort( T* arr, int n ) {    T x;    int i, j;    for ( i = 1; i < n; i++ )    {           x = *(arr + i);         for ( j = i - 1; j >= 0; j--)        {               if ( x < *(arr + j) )                *(arr + j + 1) = *(arr + j);             else                break;        }           *(arr + j + 1) = x;    }   }int main()    {        int i;        int a[]={1,4,2,66,22,23,5,6,8,7,99,54};        InsertSort<int>(a, 12);        for(i=0;i<12;i++)            cout<<a[i]<<endl;            double b[]={5.1,4.5,2.2,66.5,22.6,23,5,6,18.1,7,99,54};        InsertSort<double>(b, 12);        for(i=0;i<12;i++)            cout<<b[i]<<endl;            return 0;    }