插入排序

int main()
{
int x[] = { 0,2,4,6,8,0,1,3,5,7,9 };
InsertionSort(x, 10);
for (int i = 1; i <= 10; i++)
cout << x[i] << endl;
    return 0;
}
template<class T>
void InsertionSort(T *a, int n)
{
for (int j = 2; j <= n; ++j)
{
T temp = a[j];
a[0] = temp;
int i = j - 1;
while (temp < a[i])
{
 a[i+1] = a[i];
 i--;
}
a[i+1] = temp;
}
}