I'm sure theres a simple solution to this but I'm stuck at iterating over an array of words and comparing the first word (eventually its length) against every word in the list and then checking the second against them all and the third and so forth.

if I had two options I could do something like this

```
word1 = "weird"
word2 = "wired"

if word1.chars.sort.length == word2.chars.sort.length
  true
else
  false
end

```

im starting simple. 

EDIT

having these words I would check whether they are anagrams.

I have a text file with thousands of words. So 
the out put would be something similar to this

```
There were 17346 anagram words found.
Would you like to list them? (Y/n)> Y
...
weird wider wierd wired wried
weirs wires wiser wries

```

EDIT 2

I want to write a program that will find all of the anagrams <http://en.wikipedia.org/wiki/Anagram> in a wordlist. For example, the words "silent" and "listen" are anagrams.

imagine a dictionary there are many anagrams there, but they are not in order, or related, they have the same elements but different positions, the program would be satisfied with reading from the word.txt file and finding the anagrams words, I'd have the number of anagrams found, and a choice of displaying my findings. with a sample like this

```
...
weird wider wierd wired wried
weirs wires wiser wries
welkin winkle
welkins winkles
welting winglet
weltings winglets
wenchers wrenches
wettish whitest
whale wheal

```

something like this. 

words = %q(welting winglets with white whit withe wised wield wides ...)

the iteration would from welting to winglets check if they're anagram
if so perhaps store in a new array or something. then go to with check it, and so on.