logo CodeStepByStep logo

Main Page → Exercises → C++ → Solve an Exercise

combin

Language/Type: C++ backtracking recursion
Related Links:

Write a recursive function named combin that is a variation of the previous problem, permute. Your function accepts a string as a parameter and outputs all *unique* possible rearrangements of the letters in that string. The arrangements may be output in any order. For example, the call of combin("ABC"); should print: 

ABC
ACB
BAC
BCA
CAB
CBA

If the string passed is empty, print no output. Your function must use recursion, but you can use a single for loop if necessary.

Function: Write a C++ function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.