#include<iostream>
#include<cstdio>
#include<vector>//用vector容器來(lái)存儲(chǔ)
#include<algorithm>//算法頭文件
using namespace std;
void myprint(int rel)
{
    cout << rel;
}
void test01()
{
    vector<int>v;
    for (int i = 0; i < 10; i++)
    {
        v.push_back(i);
    }
    //插入
    sort(v.begin(), v.end());
    //從小到大
    for_each(v.begin(), v.end(), myprint);
    //遍歷輸出
}
int main()
{
    test01();
    return 0;
}

sort(v.begin(), v.end(), greater<int>());
//用greater，其中g(shù)reater表示內(nèi)置類型從大到小排序，
//less表示內(nèi)置類型從小到大排序。

//自定義函數(shù)來(lái)進(jìn)行輸出
bool getor(int v1, int v2)
{
	return v1 > v2;
}
sort(v.begin(), v.end(), getor);

//洗牌排序，打亂隨機(jī)分配
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
void myprint(int val)
{
    cout << val << " ";
}
void test01()
{
    vector<int>v;
    for (int i = 0; i < 10; i++)
    {
        v.push_back(i);
    }
    random_shuffle(v.begin(), v.end());
    for_each(v.begin(), v.end(), myprint);
}
int main()
{
    test01();
    return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
void myprint(int val)
{
	cout << " " << val;
}
void test01()
{
	vector<int>v;
	vector<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
		v1.push_back(i + 1);
	}
	vector<int>vTarget;
	//歸并

	//要提前分配內(nèi)存
	vTarget.resize(v.size() + v1.size());
	merge(v.begin(), v.end(), v1.begin(), v1.end(), vTarget.begin());
	for_each(vTarget.begin(), vTarget.end(), myprint);
}
int main()
{
	test01();
	return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
void myprint(int val)
{
	cout << " " << val;
}
void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);

	}
	reverse(v.begin(), v.end());
	for_each(v.begin(), v.end(),myprint);
}
int main()
{
	test01();
	return 0;
}