88 常用排序算法-reverse

#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <algorithm>
#include <ctime>

using namespace std;

//stl常见算法
/*
1.algorithm
2.numeric
3.functional
*/


void mprint(int val)
{
	cout << val << "  ";
}

//常用排序算法reverse  翻转
//内置数据类型
void test01()
{
	//重要说明

	vector<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}

	for_each(v1.begin(), v1.end(), mprint);//0  1  2  3  4  5  6  7  8  9
	cout << endl;

	reverse(v1.begin(), v1.end());
	for_each(v1.begin(), v1.end(), mprint);//9  8  7  6  5  4  3  2  1  0
	cout << endl;

}


int main()
{
	test01();
	system("pause");
	return 0;
}