Question: Write a recursive function that reads a string of 3 up to 7 characters and then generates all its permutations. Example, if the user enters
Write a recursive function that reads a string of 3 up to 7 characters and then generates all its permutations. Example, if the user enters ABC then the program should print the values: ABC, ACB, BAC, BCA, CAB, CBA.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
