100-CPP-Programs-Practice/63.cpp at main · prakharjadaun/100-CPP-Programs-Practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<iostream>
#include<algorithm>
#include<vector>
int main()
{
    //program to understand the next_permutation() and the prev_permutation func.
    //initialzing a vector
    std::vector<int> v = {1,3,2};

    //sorting the vector
    std::sort(v.begin(),v.end());

    std::cout<<"Vector : ";
    for(int i=0;i<v.size();i++)
    {
        std::cout<<v[i]<<" ";
    }
    std::cout<<std::endl;

    //printing the all possible permutations
    do
    {
        for(int i=0;i<v.size();i++)
        {
            std::cout<<v[i]<<" ";
        }
        std::cout<<std::endl;
    } while(std::next_permutation(v.begin(),v.end()));

    std::cout<<"After loop, Vector : ";
    for(int i=0;i<v.size();i++)
    {
        std::cout<<v[i]<<" ";
    }
    std::cout<<std::endl;


    //reversing the vector v for prev_permutation func.
    std::reverse(v.begin(),v.end());

    //printing the all possible permutations
    do
    {
        for(int i=0;i<v.size();i++)
        {
            std::cout<<v[i]<<" ";
        }
        std::cout<<std::endl;
    } while(std::prev_permutation(v.begin(),v.end()));

    std::cout<<"After loop, Vector : ";
    for(int i=0;i<v.size();i++)
    {
        std::cout<<v[i]<<" ";
    }
    std::cout<<std::endl;

    return 0;

}