/C++/All permutations with repetition C++

All permutations with repetition C++

#include <string>
#include <iostream>


void print_str(const char*,std::string,const int, const int);

int main()

{

    int lenght = 2;

    char str[] = {'A', 'B', 'C', 'D'};



    int n = sizeof str;

    print_str(str, "", n, lenght);  //Note: this function works on all cases and not just the case above

    return 0;

}

// The main recursive method to print all possible strings of length "length"
    void print_str(const char str[],std::string prefix,const int n, const int lenght)

    {

        if (lenght == 1)

            {

                for (int j = 0; j < n; j++)

                std::cout << prefix + str[j] << std::endl;

            }//Base case: lenght = 1, print the string "lenght" times + the remaining letter

        else

            {


               // One by one add all characters from "str" and recursively call for "lenght" equals to "lenght"-1
                for (int i = 0; i < n; i++)

                // Next character of input added
                print_str(str, prefix + str[i], n, lenght - 1);
                // "lenght" is decreased, because we have added a new character

            }

    }

Source: stackoverflow.com

Similar codes

0 vote103 views1 answer
Char at in c++
C++
5 votes111 views6 answers
While loop c++
C++
0 vote114 views1 answer
Extra parameter in comparator function for sort
C++
0 vote117 views2 answers
C++ compile to msi
C++
0 vote117 views1 answer
C++ unordered_map check if key exists
C++
0 vote126 views1 answer
C++ enter name and surname one string
C++
-1 vote57 views3 answers
Program to check smallest num in three numbers in c++
C++
12 votes106 views3 answers
Max element in array c++ stl
C++
0 vote98 views1 answer
Why constructor can't be static in c++
C++
0 vote109 views1 answer
How to use a non const function from a const function
C++