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);
}
}
}find all permutations of a string
ABC
ACB
BAC
BCA
CBA
CABCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
