插入排序

#include "stdafx.h"

#include <iostream>
#include <vector>
using namespace std;

template<class T>
void insertion_sort(vector<T>& vec)
{
	for(int i=1;i<vec.size();++i)
	{
		T temp=vec[i];
		int j=i-1;
		while(j>=0&&vec[j]>temp)
		{
			vec[j+1]=vec[j];
			--j;
		}
		vec[j+1]=temp;
	}
}

int main()
{
	vector<int> ivec;
	for(int i=0;i<10;++i)
	{
		int n=rand()%10;
		ivec.push_back(n);		
	}
	cout<<"befor sort"<<endl;
	for(vector<int>::iterator iter=begin(ivec);iter!=end(ivec);++iter)
	{
		cout<<*iter<<" ";
	}
	cout<<endl;
	insertion_sort(ivec);
	cout<<"after sort"<<endl;
	for(vector<int>::iterator iter=begin(ivec);iter!=end(ivec);++iter)
	{
		cout<<*iter<<" ";
	}
	cout<<endl;
	return 0;
}