随机排序

#include 
#include 
#include 
#include 
#include 
using namespace std;

// 查找：find find_if  binary_search
// 统计：count count_if
// 排序：sort    随机排序（洗牌算法）
// 遍历：for_each
// 转换：transform
// 交换：swap
// 逆序：reverse

void print(vector &v)
{
    vector::iterator it = v.begin();
    while (it != v.end())
    {
        cout <<*it << " ";
        ++it;
    }
    cout << endl;
}


void func()
{
    vector v = {1,2,3,4,5,6,6,6};
    bool ret = binary_search(v.begin(), v.end(), 6);
    cout << ret << endl;
    swap(v[2], v[4]);
    print(v);
}

//
void func2()
{
    vector v = {
                "曾从威 ",
                "蒋恺均 ",
                "刘江涛 ",
                "崔雅倩 ",
                "祝秋培 ",
                "吴赟鹏 ",
                "李鸿飞 ",
                "王  虎",
                "缪  峰",
                "张  龙",
                "刘加封 ",
                "姚  笛",
                "郑  丹",
                "孔海宇 ",
                "陈逸伦 ",
                "徐煜清 ",
                "陈  喆",
                "盛  开",
                "方文倩 ",
                "边金鹏 ",
                "陈振宇 ",
                "陶小康 ",
                "孙凌霄 ",
                "王玉恒 ",
                "王娇娇 ",
                "许新华 ",
                "胡光兴 ",
                "周  波",
                "王  鹏",
                "李鸿飞 ",
                "陈  程",
                "徐小蕤 ",
                "李  峰",
                "王  琦",
                "陈梦玉 ",
                "陈志辉 ",
                "李  森",
                "陈  芳"
    };

    srand((unsigned int)time(NULL));
    random_shuffle(v.begin(), v.end());

    for (int i = 0; i < v.size(); i++)
    {
        if (i%4==0)
            cout << endl;
        printf ("%-15s", v[i].c_str());
    }
    cout << endl;
}

int main()
{
    func2();
    return 0;
}