插入排序實現_c++

template<class Type>
void InsertSort(vector<Type>& a)
{
	for (int j = 1; j < a.size(); ++j)
	{
		Type key = a[j];
		int i = j-1;

		while (i>=0 && a[i]>key)
		{
			a[i+1] = a[i];
			i--;
		}

		a[i+1] = key;
	}
}