What is the algorithm to display al possible combinations of a string?
There are N^N combinations

If the string is "ab"
the output should be: ab,ba,aa,bb 2^2=4 combinations

if the string is "abc"
the output should be: abc, acb, aab,aac,aaa,aba, ..... 3^3=27 combinations

well I can give some tips, not the full code..

this is example for str with 2 char,


for more than 2 char, 3 or 4 may need 3 or 4 for loops, so obviously you need to use recursion tecniques for this, just try out for two chr first, then implement using recursion...

__________________
When you say "I wrote a program that crashed Windows," people just stare at you blankly and say "Hey, I got those with the system, for free." Linus Torvalds

Thanks,
but I know, obviously, how to use loops for finite number of chars.
I need to know how to recurs it.