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 votes64 views4 answers
Power in cpp
C++
0 vote101 views1 answer
Prevent getting data from data-tooltip-content tippyjs
C++
1 vote101 views1 answer
Start with pure c++ and opengl gamedev
C++
13 votes66 views27 answers
Cpp hello
C++
27 votes104 views2 answers
How to remove an element from a vector by value c++
C++
0 vote117 views1 answer
Walk filesystem in c++
C++
0 vote116 views1 answer
Quicksort taking random pivot
C++
1 vote114 views1 answer
How to specify how many decimal to print out with std::cout
C++
0 vote102 views1 answer
Typeid to string c++
C++
0 vote123 views1 answer
Basic stack implementation in c++
C++