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

5 votes117 views1 answer
All library in c++
C++
0 vote108 views1 answer
Sinh to hop c++
C++
5 votes65 views4 answers
Int length c++
C++
1 vote94 views1 answer
How to reset linerenderer unity
C++
0 vote100 views1 answer
Composition namespaces c++
C++
-1 vote128 views1 answer
Combination sum iv leetcode
C++
7 votes110 views2 answers
Min heap stl
C++
0 vote115 views1 answer
C++ method name
C++
2 votes115 views1 answer
C++ custom compare in set
C++
0 vote102 views1 answer
C++ allocate dynamic with initial values
C++