Find permutations

Find all permutations of a string

void permute(string a, int l, int r)  
{  
    // Base case  
    if (l == r)  
        cout<<a<<endl;  
    else
    {  
        // Permutations made  
        for (int i = l; i <= r; i++)  
        {  
  
            // Swapping done  
            swap(a[l], a[i]);  
  
            // Recursion called  
            permute(a, l+1, r);  
  
            //backtrack  
            swap(a[l], a[i]);  
        }  
    }  
}

Find permutations

void find_permutations(vector<int> &array, size_t index, vector<int> current_perm, vector<vector<int>> &res){
    if(index == array.size()) 
        res.push_back(current_perm);
    else{
        for(size_t i = 0; i <= current_perm.size(); ++i){
            vector<int> new_perm(current_perm.begin(), current_perm.end());
            new_perm.insert(new_perm.begin()+i, array[index]);
            find_permutations(array, index+1, new_perm, res);
        }
    }
}

Source: practice.geeksforgeeks.org

Similar codes

0 vote104 views1 answer
Graph using queue c++
C++
0 vote112 views1 answer
Rgb(100,100,100,0.5) validation c++
C++
1 vote113 views2 answers
Cpp vector2
C++
0 vote123 views1 answer
Tan ^-1 ti 83
C++
2 votes110 views1 answer
Hwo to calculate the number of digits using log in c++
C++
1 vote117 views2 answers
C++ cast to type of variable
C++
0 vote124 views1 answer
Int main ( ) { int i,n; cin>>n; i=n; while(i>=1) { i=i+5; i=i-6; } }
C++
0 vote111 views1 answer
C++ json parser euc-kr
C++
0 vote69 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
5 votes113 views1 answer
C++ vector iterator
C++