Full Permutation next_ Permutation() function

There is the following code in the header file ：

int a[];
do
{
    

}
while(next_permutation(a,a+n));

produce 1~n The full array code of is as follows ：

#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
    
    int n;
    while(scanf("%d",&n)&&n){
    
        int a[1000];
        for(int i=0;i<n;i++){
    
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        do{
    
            for(int i=0;i<n;i++)
                printf("%d ",a[i]);
            printf("\n");
        }while(next_permutation(a,a+n));
    }
    return 0;
}

For example, the input

3

1 0 2

If there is sort()

Output is

0 1 2
0 2 1
1 0 2
1 2 0
2 0 1
2 1 0

If there is no

The output of

1 0 2
1 2 0
2 0 1
2 1 0

Discovery function next_permutation() It is arranged in dictionary order , And it increases from the current dictionary order in the array to the maximum dictionary order , stay ACM International Collegiate Programming Contest, Egyptian Collegiate Programming Contest (2015) Arab Academy for Science and Technology - Alexandria, November 6th, 2015 A Questions can be used next_permutation().

Original blog ：https://www.cnblogs.com/My-Sunshine/p/4985366.html