template<class T>
void insertionsort(T data[], int nLength)
{
for (int i = 1; i < nLength; i++)
{
int j;
T tmp = data[i];
for (j = i; j > 0 && tmp < data[j-1]; j--)
{
data[j] = data[j - 1];
}
data[j] = tmp;
}
}
template<class T>
void insertionsort(T data[], int nLength)
{
for (int i = 1; i < nLength; i++)
{
int j;
T tmp = data[i];
for (j = i; j > 0 && tmp < data[j-1]; j--)
{
data[j] = data[j - 1];
}
data[j] = tmp;
}
}