Answer:
The pseudocode is given below
Step-by-step explanation:
Pseudocode
- Prompt user to enter string
- Pass it to combination function which will calculate the total combination and will return it in array
- In combination method -
- Check if the string is length 2 size ie of 0 or 1 length then return string itself
- Else iterate through string user entered
- Get the current character in variable and check if the variable is already used than skip
- Create a string from 0 to ith index + (concatencate) i+1 to length and recursive call combination function and pass this string and store result in subpermutation array
- For each recursive call push character + subPermutation in totalArrangement array .