1. How do l find all the permutations of a string? You can use this pseudocode which prints out all permutations of a string to get started: void printPermutations (string prefix, string rest) if (rest is empty) Display the prefix string else t For each character in rest Add the character to the end of prefix Remove character from rest. Use recursion to generate permutations with the updated values for prefix and rest. 2. I thought you said that we couldn't use any iteration. Isn't the pseudocode using a loop? Yes, printPermutations uses iteration (a for loop), which this assignment does not allow Suppose you have a for loop of the form: for (i -initval; max) statement; Loop(i 1, max); return; You can replace the for loop above with the following invocation of Loop: Loop (initval, maxval)