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 vote203 views1 answer
What is require to run min max function on linux in cpp
C++
0 vote202 views1 answer
Std::cout and cout
C++
1 vote222 views1 answer
Select one random element of a vector in c++
C++
0 vote213 views1 answer
Programs using vectors in c++
C++
1 vote213 views1 answer
C++ check if debug or release visual studio
C++
0 vote222 views1 answer
C++ overloading by ref-qualifiers
C++
0 vote206 views1 answer
C++ calorie calculator using a for loop
C++
1 vote190 views1 answer
Cuda dim3
C++
0 vote161 views1 answer
C++ include a file in another directory
C++
-1 vote206 views1 answer
Transformer in nlp
C++