All Permutations of a word [C++]

[HexMurder]

So i just started learning C++ and I've been looking up different beginners programs, most of which I've been able to complete without any issues. This one however has me STUCK. I can't even begin to think up what to code to solve this.

Basically the challenge is to have a user input a word, and then have the console take the word, and output it with every possible permutation of that word, each on a new line.

Here is a sample for the input cat

cat
cta
act
atc
tac
tca

I'm sure this isn't as hard as it seems to me, but i'd really appreciate it if someone could solve this for me so i could take a look at the code!

[ESchrödinger]

Programming isn't about being able to write code, anyone can type on a keyboard as long as they have half a brain. Programming is all about problem solving and you seem to have come across a problem, and instead of facing it and trying all possible methods (which I highly doubt you did), all you did was ask for some code. Since I won't stand around and tell you about how you made a mistake, I'll give you a hint in solving this issue because giving you the code doesn't help anyone :

Read these :

Wikipedia - Permutations
Wikipedia - Combinations

then create a function that uses a formula instead of arrays and such and calculates the value. Counting chars would work too.

Hope this helps, in a way.

[R3DDOT]

Calculating the amount of permutations is easy:


For a word with k-chars, and with each char repeating itself n1,n2,n3...nk times,respectively, then the total amount of permutations is:

__________k!
_____________________
(n1!×n2!×n3! ×(…)× nk!)


To show the permutations themselfs.. well, goood luck with that.
I have no clue on how to do this efficiently.

[Auxilium]

I did this 4 years ago using vectors relatively easily.

[R3DDOT]

I did this 4 years ago using vectors relatively easily.

It is easy to do words that don't have repeating characters, for the others it's lot harder.
A unefficient way is logging all permutations and removing identical ones.