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 vote130 views1 answer
Kadane algorithm with negative numbers included as sum
C++
17 votes150 views6 answers
Find max value in array c++
C++
0 vote142 views1 answer
C++ while loop decrement
C++
0 vote143 views1 answer
Cudamemcpy
C++
1 vote140 views3 answers
Comment in c++
C++
0 vote146 views1 answer
How to adjust and delete memory in c, c++
C++
-1 vote132 views1 answer
Initialize variable in switch case c++
C++
0 vote147 views1 answer
Finding no of unique characters in a string c++
C++
0 vote150 views1 answer
Ue4 modular character
C++
0 vote142 views1 answer
How to delete repeated element in stack c++
C++