The generatePermutations method takes two parameters: currentPermutation and remainingString. It checks if the remainingString is null. If so, it returns, as there is nothing more to process. It ...

// Calls the other displayPermutation function with the first string being a blank and second string being the string it started with to start ...

A recursive approach (which is what I would use) would involve breaking the problem into isomorphic subproblems: to find all permutations of a string, find all permutations of the string without a ...