三种低级排序方法(冒泡 选择 插入)

//冒泡排序
template<class T>
void ReviewBulk(vector<T> &v, size_t size)
{
	for(int outer = 1; outer < size - 1; outer++)
	{
		for(int inter = 0; inter <= size - outer - 1; inter++ )
			if(v[inter] > v[inter + 1])
				swap(v[inter], v[inter + 1]);
	}
}


//选择排序
template<class T>
void ReviewSelect(vector<T> &v, size_t size)
{
	int index;
	for(int outer = 0; outer < size - 1; outer++)
	{
		index = outer;
		for(int inter = outer + 1; inter < size; inter++)
		{
			if(v[inter] < v[index])
				swap(v[inter], v[index]);
		}
	}
}

//插入排序
template<class T>
void ReviewInsert(vector<T> &v, size_t size)
{
	T temp;
	int inter;
	for(int outer = 1; outer <= size - 1; outer++)
	{
		temp = v[outer];
	/*	inter = outer - 1;
		while(inter > 0 && v[inter] > temp)
		{
			v[inter + 1] = v[inter];
			--inter;
		}
		v[inter + 1] = temp;*/

		insertFuc(v,temp,outer - 1);
	}
}


template<class T>
void insertFuc(vector<T> &v, const T &e, size_t index)
{
	while(index > 0 && v[index] > e)
	{
		v[index + 1] = v[index];
		index--;
	}
	v[index + 1] = e;
}