Here is one interesting, apparently simple(on paper), problem.

Write a program to find and print all permutations of a given string.

This is a right type of problem for using recursion. And any recursive solution , in theory can be implemented as a iterative(non-recursive) solution. I would be posting the solution here in few days.

## No comments:

Post a Comment