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 vote181 views1 answer
How does header files work in c++
C++
0 vote190 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
1 vote174 views2 answers
Cpp vector2
C++
1 vote182 views2 answers
Why use python
C++
0 vote138 views1 answer
Interest rate parity
C++
2 votes171 views2 answers
Slice a vector c++
C++
0 vote277 views1 answer
How to set a variable to infinity in c++
C++
0 vote207 views1 answer
Array copx c++
C++
10 votes189 views1 answer
How to append one vector to another c++
C++
3 votes129 views1 answer
Rapidjson parse
C++