logo CodeStepByStep logo

combin

Language/Type: C++ backtracking recursion
Related Links:
Author: Marty Stepp (on 2016/06/16)

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.

Type your C++ solution code here:


This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.