Bruteforce

[ErGingerbreadMandude]

Basically what i want to do is this:

Input Example 1:

abc

Output:

abc
acb
bac
bca
cba
cab

Input Example 2:

abcd

Output:

abcd
abdc
acdb
acbd
adbc
adcb
bacd
badc
bcda
bcad
bdac
bdca
cabd
cadb
cbda
cbad
cdab
cdba
dacb
dabc
dbca
dbac
dcda
dcad


What i want to do is to print all the different possibilities of a given string.


The current method i'm following:

*Swap the first character with the second character
*Swap the second character with the third character
*Repeat swapping until at least one of the character involved in swapping is the null character.


The problem with my current method:

*Hell lot of duplications,i.e,"input" outputting atleast more than once.
*Doesn't output all the combinations.

What i'd like for you to do is give me some hints as to what i'm doing wrong and give me a working pseudo code to solve my crisis(not a direct solution,please).
Yes,i could've posted this in some programmer forum,but i'm not sure how i'm supposed to form my question.I'd go there and indefinitely make myself look a fool  This forum is more safe since we've already established i'm a moron.

P.S. 
I spend all my last years vacation trying to find a solution to this problem and i did.The problem is,it was kind of like a fluke,i think.
I spend so much time on it,it worked at last,i slept and i woke up,i tried to read my code and i was like wtf is this.
Short story short: I solved the problem but after a good night's sleep i no longer remembered how i solved it,and i couldn't even figure what i did in my code either,yeah my code was that ugly.
I've tested that program,and it works,but although it works i'm not sure if its the most efficient,also there are a lot of duplications,so instead of my cave man problem solving skills,i was wondering if someone could provide me with a methodical approach to the problem.
If its possible i'd like a Recursive as well as an iterative approach to solve the problem(i prefer iterative solution though).

[vorlon13]

What platform were you wanting to run this on ?

There is a routine for the HP41 somewhere in my collection of PPC Journal back issues that does what you want.

[Aractus]

I would use a container method. For word size n, for example where n=4:

ABCD

n1(n2(n3(n4))) ... n1(n4( ... )) ... n2 ... n4

[vorlon13]

Found this, if you change the 'digit map' it will do what you want apparently. (I'm not familiar with 'Python', BTW)

digit_map = {
'2': 'abc',
'3': 'def',
'4': 'ghi',
'5': 'jkl',
'6': 'mno',
'7': 'pqrs',
'8': 'tuv',
'9': 'wxyz',
}

def word_numbers(input):
input = str(input)
ret = ['']
for char in input:
letters = digit_map.get(char, '')
ret = [prefix+letter for prefix in ret for letter in letters]
return ret

[ErGingerbreadMandude]

I would use a container method. For word size n, for example where n=4:

ABCD

n1(n2(n3(n4))) ... n1(n4( ... )) ... n2 ... n4

I'm sorry,i'm not familiar with the concept of a container method.Anyhow i'd be much appreciative if you could provide me with a pseudo code or an algorithm.

Found this, if you change the 'digit map' it will do what you want apparently. (I'm not familiar with 'Python', BTW)

digit_map = {
   '2': 'abc',
   '3': 'def',
   '4': 'ghi',
   '5': 'jkl',
   '6': 'mno',
   '7': 'pqrs',
   '8': 'tuv',
   '9': 'wxyz',
}

def word_numbers(input):
 input = str(input)
 ret = ['']
 for char in input:
   letters = digit_map.get(char, '')
   ret = [prefix+letter for prefix in ret for letter in letters]
 return ret

Thanks,but god that looks ugly,i can't make sense of the code probably because i'm not familiar with that language,i don't really want the code,i just want the algorithm or pseudo code.

P.S. I'm using c,not that it helps,just saying.

[Alex K]

Technically, what you want to do is generate all permutations of a given ordered tuple. Why don't you read the wiki on "permutations" and see if something useful comes out...

[Aoi Magi]

Read this: http://www.cs.princeton.edu/~rs/talks/perms.pdf

[ErGingerbreadMandude]

Read this: http://www.cs.princeton.edu/~rs/talks/perms.pdf

Looks nice,i'll give it a look.

[LastPoet]

In any coder forum that I use, people usually frown upon giving others the sollution for the homework given to a student, but I will give a clue: It can be done iteratively or recursively. Here is the code:

---

// insert your work here, do you expect to have everything done for you?
// if that is true, when you get a girlfriend, tell her to come to me so I can fuck her for you

---

I hate lazy people

[ErGingerbreadMandude]

In any coder forum that I use, people usually frown upon giving others the sollution for the homework given to a student, but I will give a clue: It can be done iteratively or recursively. Here is the code:

---

// insert your work here, do you expect to have everything done for you?
// if that is true, when you get a girlfriend, tell her to come to me so I can fuck her for you

---

I hate lazy people

Hahahaha nice one.
You have no idea how much time i've had spend on this problem,i had to give in to my temptation.Sawry 

Edit: I love how you used "//"