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 vote175 views1 answer
How to extract a folder using python
C++
2 votes159 views2 answers
C++ round number down
C++
0 vote170 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++
0 vote164 views1 answer
Initializer before void c++
C++
1 vote159 views1 answer
C++ round number up
C++
0 vote188 views1 answer
C++ program transpose of matrix
C++
0 vote193 views1 answer
C++ functions dynamic vector
C++
4 votes182 views1 answer
How to delete a 2d dynamic array in c++
C++
0 vote166 views1 answer
Extra parameter in comparator function for sort
C++
0 vote190 views1 answer
C++ class constructor variable arguments
C++