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 vote239 views1 answer
C++ Greatest common divisor
C++
3 votes247 views1 answer
Map declaration c++
C++
0 vote280 views1 answer
Three way comparison operator c++
C++
0 vote240 views1 answer
Niet werkend
C++
2 votes230 views1 answer
Print data type of a variable in c++
C++
0 vote256 views1 answer
Haxelib install cpp
C++
1 vote245 views1 answer
Plus (programming language)
C++
0 vote259 views1 answer
Assert warning c++
C++
1 vote267 views1 answer
Flags for g++ compiler
C++
0 vote230 views1 answer
C++ generate a random letter
C++