sort排序与二分查找

#include<iostream>

#include<vector>

#include<algorithm>

#include<string>

using namespace std;

int main()

{

    const int N=;

    string a[N]={"www","algorithm","racer","text","wait"};

    vector<string> b(a,a+);//数组转化成向量

    for(size_t i=;i<N;++i)

        cout<<b[i]<<" ";

    cout<<endl;

    sort(a,a+N);

    for(int i=;i<N;++i)//使用sort进行数组排序

        cout<<a[i]<<" ";

    cout<<endl;

    sort(b.begin(),b.end());//向量正序排列

    for(const auto& x:b)

        cout<<x<<" ";

    cout<<endl;

    sort(b.rbegin(),b.rend());//向量倒序排列

    for(const auto& x:b)//基于范围的for循环

        cout<<x<<" ";

    cout<<endl;

    system("pause");

    return ;

}