Word Unscrambler

[gitoxa]

Word Unscrambler.
You type in a word, the program will tell you all the other possible words creatable from the given letters.

Note:
I got the word list from the list that comes with BSD, complain at them for missing words.
Does take slightly longer with longer words. The amount possiblies is equal to the factorial of the length of the word.
for example, an 8 letter word = 8*7*6*5*4*3*2*1 = 40320 possible letter arrangements

[zylum]

If you have a word list, then finding the possible words should not be equal to the factorial of the length of the word.. There are a couple of ways to make it way faster. 20 bits if you come up with one of those ways. (trying to encourage problem solving here )

[petree08]

good start, are you using recursion.

[gitoxa]

petree08 @ Mon May 12, 2008 9:25 am wrote:

good start, are you using recursion.

No, all I know about recursion is the 15 seconds I paid attention to the lesson you guys had.

zylum @ Mon May 12, 2008 4:57 am wrote:

If you have a word list, then finding the possible words should not be equal to the factorial of the length of the word..

There are ways to eliminate possibilties before ever looking through the files for them. Such as, with the word "monkey" since there are no words that begin with "mk" or "km" then I could, at that point, automatically switch the those letters around.

I'll think of more when I don't have a six page chemistry paper due in a couple of days. lol

[Tallguy]

awsome, well done

[andrew.]

Very cool. Bits to you!

[gitoxa]

I've been working on it, yay attention span! and managed to speed it up a little bit.

Mostly just in the form of remaking the word library, and the way the program looks for words. This one contains a lot more words though(plurals, inflections, etc), so the difference in speeds isn't as large as I'd wished.

Source is in there, if you really want to see it... but it's hella bad convention-wise.