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 vote194 views1 answer
C++ power
C++
0 vote196 views1 answer
C++ read_ascii
C++
2 votes196 views1 answer
C++ print current time
C++
1 vote190 views1 answer
Print all chrchetrs of a string c++
C++
2 votes333 views2 answers
Editable div
C++
0 vote179 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++
19 votes227 views1 answer
How to do file handling in c++
C++
0 vote189 views1 answer
Left margin c++
C++
0 vote181 views1 answer
C++ handling
C++
0 vote218 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++