Hi everyone!
I've been bothering with this problem for about a pair of
months (without getting a solution!). The question in fact
is simple: given a word of a n length, getting all the
possible (n!) anagrams. If there are more words, space has
to be considered as a character. For example:

- one = one, neo, eon, oen, noe, eno


I have tried some recursive processes but... no way! I
really can't figure out how to solve this!

If you have any idea...
Thanks