STL的排列算法next_permutation

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
//定义一个测试数组
void TestArray()
{
   cout << "TestArray is :" << endl;
   int b[] = {3, 2, 1};
   int count = sizeof(b) / sizeof(int);
   //因为next_permutation(a, a + count)从当前序列开始，只输出比它大的数列
   for(int i = 0; i < count; ++i)
   {
      cout << b[i] << " ";
   }
    cout << endl;
   next_permutation(b, b + count);
   do
   {
      for(int i = 0; i < count ; ++i)
       {
           //cout << a[i] << " ";
           cout << b[i] << " ";
       }
       cout << endl;
   }while(next_permutation(b, b + count));
   cout << endl;
}
//创建一个vector用来存放数组
//如果当前序列已经是按字典排序的最后一个序列，则next_permutation将序列排列为最低排列并返回false
//否则将输入序列变换为下一个排列，机子点的下一个排列，并返回true(此时不输出原序列)
void TestVector()
{
    cout << "TestVector is:" << endl;
    char a[] = {'c', 'b', 'a'};
    int count = sizeof(a) / sizeof(char);
    vector<char> vec(a, a+count);
    for(vector<char>::iterator itr = vec.begin(); itr != vec.end(); ++itr)
        {
            cout << *itr << " ";
        }
    cout << endl;
    next_permutation(vec.begin(), vec.end());
    do
    {
        for(vector<char>::iterator itr = vec.begin(); itr != vec.end(); ++itr)
        {
            cout << *itr << " ";
        }
        cout << endl;
    }while(next_permutation(vec.begin(), vec.end()));
   cout << endl;
}
int main()
{
    TestArray();
    TestVector();
    return 0;
}