不可变序列算法示例

问题及代码：

#include <iostream>
#include<algorithm>
#include<functional>
#include<vector>
using namespace std;

int main()
{
    int iarray[]={0,1,2,3,4,6,6,6,7,8};
    vector<int>ivector(iarray,iarray+sizeof(iarray)/sizeof(int));
    int iarray1[]={6,6};
    vector<int>ivector1(iarray1,iarray1+sizeof(iarray1)/sizeof(int));
    int iarray2[]={5,6};
    vector<int>ivector2(iarray2,iarray2+sizeof(iarray2)/sizeof(int));
    int iarray3[]={0,1,2,3,4,5,7,7,7,9,7};
    vector<int>ivector3(iarray3,iarray3+sizeof(iarray3)/sizeof(int));
    cout<<*adjacent_find(ivector.begin(),ivector.end())<<endl;
    cout<<count_if(ivector.begin(),ivector.end(),bind2nd(less<int>(),7))<<endl;
    cout<<*find_if(ivector.begin(),ivector.end(),bind2nd(greater<int>(),2))<<endl;
    cout<<*search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())<<endl;
    cout<<*search_n(ivector.begin(),ivector.end(),3,6,equal_to<int>())<<endl;
    cout<<equal(ivector.begin(),ivector.end(),ivector3.begin())<<endl;

    return 0;
}

 

运行结果：

 

知识点总结：

 跟老师写的代码一样，为什么结果不对，求解。

学习心得：