logo CodeStepByStep logo


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

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


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 exercise. 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 an exercise or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect tests, etc.), please

Is there a problem? Contact a site administrator.

©, all rights reserved.