STL中的全排列next_permutation函数

#include <iostream>#include <algorithm>using namespace std;//next_permutation()函数返回的是bool值，排列的范围为[first,last) int main(){int myints[]={1,2,3};sort(myints,myints+3);cout<<"The 3! possible permutations with 3 elements:\n";do{cout<<myints[0]<<" "<<myints[1]<<" "<<myints[2]<<endl; }while(next_permutation(myints,myints+3));   //不要忘记了这个分号 cout<<"*****************************"<<endl;cout<<"After loop:"<<myints[0]<<" "<<myints[1]<<" "<<myints[2]<<endl;return 0;}