[Make mutation recursion]

Question

Make program that the output is mutation of N character 'A', 'B', 'C' until 'J'. Where is 2 <= N <= 10.
Example:
input : N = 2
output :
A B
B A

input : N = 3
A B C
A C B
B A C
B C A
C A B
C B A

and the program must use recursion function. Please help me. Thanks😁
Any language, C++ take precedence.

Answer 1

see my code:

https://code.sololearn.com/cRS7XPNoa53p/?ref=app

Answer 2

I know you said it had to use recursion, but I just wanted to show how simple it is without recursion

https://code.sololearn.com/c2sdw8sldV5p/?ref=app

Answer 3

Thanks all👌