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 vote186 views2 answers
Balanced parentheses
C++
11 votes175 views2 answers
C++ main function
C++
0 vote188 views1 answer
Phi function (n log (log(n)))
C++
0 vote187 views1 answer
Youtube to facebook link converter
C++
14 votes164 views1 answer
Dynamically generating 2d array in cpp
C++
0 vote177 views1 answer
Restart the computer in c++ after the default time (30) seconds. (Windows)
C++
1 vote189 views1 answer
Heap c++ stl
C++
0 vote173 views1 answer
What algorithm does bitcoin use
C++
10 votes202 views2 answers
2d vector c++ declaration
C++
2 votes182 views1 answer
Print a string with printf in c++
C++