#include <iostream>

#include <algorithm>

using namespace std;

const int size = ;

int main()

{

    int a[size];

    for (int i = ; i < size; ++i)

    {

        a[i] = i;

    }

    int key = ;

    int *ip = find(a, a + size, key);

    if (ip == a + size)//不要使用NULL做指针测试，直接使用过尾元

        cout << key << "not found;" << endl;

    else

        cout << key << "found;" << endl;

    return ;

}

#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

int main()

{

    int key = ;

    vector<int> iv();

    for (int i = ; i < ; i++)

    {

        iv[i] = i;

    }

    vector<int>::iterator it, head = iv.begin(), tail = iv.end();

    it = find(head, tail, key);

    if (it != tail)

        cout << "vector contains the value" << key << endl;

    else

        cout << "vector does not contain the value" << key << endl;

    return ;

}

#include <iostream>

#include <iterator>

#include <algorithm>

#include <vector>

#include "random.h"

using namespace std;

const int size = ;

const int lower_bound = ;

const int upper_bound = ;

void Display(vector<int> &v, const char *s)

{

    cout << endl << s << endl;

    vector<int>::iterator head = v.begin(), tail = v.end();

    ostream_iterator<int> oit(cout, ";");

    copy(head, tail, oit);

    cout << endl;

}

int main()

{

    vector<int> a(size);

    for (int i = ; i < size; ++i)

    {

        a[i] = GenerateRandomNumber(, );

    }

    Display(a, "Array generated:");

    vector<int>::iterator head = a.begin(), tail = a.head();

    sort(head, tail);

    Display(a, "Array sorted:");

    reverse(head, tail);

    Display(a, "Array reversed;");

    return ;

}