标准库中sort与unique

这里是一个很简单的测试代码，测试sort与unique两个函数的用法。依稀能看到迭代器的影子。

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
using namespace std;


int main()
{
    int arr[] = {1, 3, 0, 3, 5, 7, 9, 4, 5};
    int i = 0;
    int len = sizeof(arr) / sizeof(int);
    vector<int> ivec;
    for (i = 0; i < len; i++)
        ivec.push_back(arr[i]);
    vector<int>::iterator iter;
    iter = ivec.begin();
    cout << "org data:" << endl;
    for (iter = ivec.begin(); iter != ivec.end(); iter++)
        cout << *iter << ' ';
    cout << endl;
    vector<int>::iterator uniq_end;
    sort(ivec.begin(), ivec.end());
    cout << "sort data:" << endl;
    for (iter = ivec.begin(); iter != ivec.end(); iter++)
        cout << *iter << ' ';
    cout << endl;
    uniq_end = unique(ivec.begin(), ivec.end());
    ivec.erase(uniq_end, ivec.end());
    cout << "uniq data:" << endl;
    for (iter = ivec.begin(); iter != ivec.end(); iter++)
        cout << *iter << ' ';
    cout << endl;
    return 0;
}