c++algorithm库部分函数(2)

#include<iostream>
#include<algorithm>
using namespace std;
#include<vector>
bool isOdd(int i)
{
	return (i % 2 == 1);
}
void print(int i)
{
	cout << i << " ";
}
int main()
{
	//cout函数计算容器内出现某值的次数
	cout << "cout()-----------------" << endl;
	int data[] = {10,20,20,25,30};
	auto counts = count(data, data + 5, 20);
	cout << counts << endl;
	//cout_if函数计算容器内满足回调函数为真的值的个数
	cout << "cout_if()-----------------" << endl;
	auto m = count_if(data, data + 5, isOdd);
	cout << m << endl;
	//replace函数使用一个新值替换容器内的某一旧值;replace_if即满足某一条件，就用新值替换旧值
	//replace_copy函数即用一个新的容器保存替换之后的值序列（在第三个参数传入新容器的首指针）
	cout << "replace()-----------------" << endl;
	vector<int> a(data,data+5);
	replace(a.begin(), a.end(), 20, 10);
	for_each(a.begin(),a.end(),print);
	cout << endl;
	//remove函数移出容器内与传入值相等的值，且返回新的尾指针，其并不更改原容器大小，只是将原容器内的不等于
	//传入值的后面的值通过赋值的方式前移，并以新的尾指针表示结束
	//remove_if和remove_copy用法与replace相似
	cout << "remove()-----------------" << endl;
	vector<int> b(data,data+5);
	auto nend=remove(b.begin(),b.end(),25);
	for_each(b.begin(),nend, print);
	cout << endl;
	//copy函数,copy_if同理
	cout << "copy()-----------------" << endl;
	vector<int> c(5);
	copy(data,data+5,c.begin());
	for_each(c.begin(), c.end(), print);
	cout << endl;
	cout << "copy_n()-----------------" << endl;
	vector<int> d(4);
	copy_n(data,4,d.begin());
	for_each(d.begin(), d.end(), print);
	cout << endl;
	//swap函数
	cout << "swap()-----------------" << endl;
	int e = 10, f = 20;
	swap(e,f);
	cout << e << " " << f << endl;
	vector<int> j(3,1);
	vector<int> k(4, 2);
	swap(j,k);
	cout << "j原来为3个1,交换后为： " << endl;
	for_each(j.begin(),j.end(),print);
	cout << endl;
	//reverse函数反转容器数据;reverse_copy
	cout << "reverse()-----------------" << endl;
	int data1[] = {1,2,3,4};
	reverse(data1,data1+sizeof(data1)/sizeof(int));
	for_each(data1,data1+4,print);
	cout << endl;
	//sort函数对容器元素排序
	cout << "sort()-----------------" << endl;
	int data2[] = { 1,3,2,4 };
	sort(data2,data2+4);
	for_each(data2, data2 + 4,print);
	cout << endl;
	cout << "sort函数部分排序" << endl;
	vector<int> data3;
	data3.push_back(2);
	data3.push_back(1);
	data3.push_back(4);
	data3.push_back(3);
	sort(data3.begin(),data3.begin()+3);
	for_each(data3.begin(), data3.end(), print);
	cout << endl;
	//partial_sort会对比中间元素小的元素升序排序，而对其之后的元素不排序
	cout << "partial_sort部分排序" << endl;
	int data4[] = {1,3,4,5,2,7,6};
	partial_sort(data4,data4+4,data4+7);
	for_each(data4, data4+7, print);
	cout << endl;
}

输出结果：