//10_11.cpp
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;

void main()
{
	int iarray[]={26,17,15,22,23,33,32,40};
	vector<int> ivector(iarray,iarray+sizeof(iarray)/sizeof(int));
	
	// 查找并輸出最大、最小值元素
	cout<<*max_element(ivector.begin(),ivector.end())<<endl;
	cout<<*min_element(ivector.begin(),ivector.end())<<endl;

	//將ivector.begin()+4-ivector.begin()各元素排序，
	//放進(jìn)[ivector.begin(),ivector.begin()+4]區(qū)間。剩余元素不保證維持原來(lái)相對(duì)次序
	partial_sort(ivector.begin(),ivector.begin()+3,ivector.end());
	copy(ivector.begin(),ivector.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//局部排序并復(fù)制到別處
	vector<int> ivector1(5);
	partial_sort_copy(ivector.begin(),ivector.end(),ivector1.begin(),
ivector1.end());
	copy(ivector1.begin(),ivector1.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//排序，缺省為遞增。
	sort(ivector.begin(),ivector.end());
	copy(ivector.begin(),ivector.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//將指定元素插入到區(qū)間內(nèi)不影響區(qū)間原來(lái)排序的最低、最高位置
	cout<<*lower_bound(ivector.begin(),ivector.end(),24)<<endl;
	cout<<*upper_bound(ivector.begin(),ivector.end(),24)<<endl;

	//對(duì)于有序區(qū)間，可以用二分查找方法尋找某個(gè)元素
    cout<<binary_search(ivector.begin(),ivector.end(),33)<<endl;
    cout<<binary_search(ivector.begin(),ivector.end(),34)<<endl;

	//下一個(gè)排列組合
	next_permutation(ivector.begin(),ivector.end());
	copy(ivector.begin(),ivector.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//上一個(gè)排列組合
	prev_permutation(ivector.begin(),ivector.end());
	copy(ivector.begin(),ivector.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//合并兩個(gè)序列ivector和ivector1，并將結(jié)果放到ivector2中
	vector<int> ivector2(13);
	merge(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end(),
ivector2.begin());
	copy(ivector2.begin(),ivector2.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//將小于*(ivector.begin()+5)的元素放置在該元素之左
	//其余置于該元素之右。不保證維持原有的相對(duì)位置
	nth_element(ivector2.begin(),ivector2.begin()+5,ivector2.end());
	copy(ivector2.begin(),ivector2.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//排序，并保持原來(lái)相對(duì)位置
	stable_sort(ivector2.begin(),ivector2.end());
	copy(ivector2.begin(),ivector2.end(),ostream_iterator<int>(cout," "));
	cout<<endl; 

	//針對(duì)一個(gè)有序區(qū)間，找出其中一個(gè)子區(qū)間，其中每個(gè)元素都與某特定元素值相同
	pair<vector<int>::iterator,vector<int>::iterator> pairIte;
	pairIte=equal_range(ivector2.begin(),ivector2.end(),22);
	cout<<*(pairIte.first)<<endl; 
	cout<<*(pairIte.second)<<endl; 

	//合并兩個(gè)有序序列，然后就地替換
	int iarray3[] = { 1, 3, 5, 7, 2, 4, 6, 8 };
	vector<int> ivector3(iarray3,iarray3+sizeof(iarray3)/sizeof(int));
	inplace_merge(ivector3.begin(), ivector3.begin()+ 4, ivector3.end());
	copy(ivector3.begin(),ivector3.end(), ostream_iterator<int>(cout, " "));  
	cout<<endl; 
	
	//以字典順序比較序列ivector3和ivector4
	int iarray4[] = { 1, 3, 5, 7,1, 5, 9, 3 };
	vector<int> ivector4(iarray4,iarray4+sizeof(iarray4)/sizeof(int));
	cout<< lexicographical_compare(ivector3.begin(),ivector3.end(),
ivector4.begin(),ivector4.end()) << endl;
}