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

1 vote315 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
0 vote389 views3 answers
Simplest code for stack implementation in c++
C++
3 votes301 views2 answers
C++ vector element search
C++
13 votes328 views6 answers
Cin in c++
C++
-4 votes318 views2 answers
Unreal engine
C++
2 votes338 views2 answers
Cpp split string by space
C++
9 votes321 views4 answers
Max c++
C++
0 vote315 views1 answer
Access part of string in c++
C++
1 vote317 views1 answer
Unique ptr c++
C++
0 vote338 views1 answer
Sinh nhi phan c++
C++