Search:

However he stated that he wants no recursive method :)

And that's better than the iterative one i provided.If you consider the complexity of what i wrote ,you will be dissapointed.

Ok,so i thought that if we let the letters of the words to be different among them,then we have to output n! permutations,where n is the number of the word's letters.So i also saw that given a string...

So the formula was n! where n is the number of the letters of the word.So you have to output that many words.As for what should be changed,still thinking of it :)

Actually can you provide a small example.For example the word "Sam" what permutations does it have?I remember that the number of them is 2³,but i am not sure i know what the goal is.Sorry for my...

Could you please your code in here enter your code in order to be more clear to everybody? :)

in order to work write code instead of key