It are single words. Letters are hustled but not encoded.if you replace al letters by ascii value and then sort all the words in numerical form (acs/desc what you want). The words in the scrambled list and in the given list will appear as the same number or have the same value if you will. Then just look em up. so;
for every unscrambled word to look up and in the wordlist:
- replace all letters with ascii value
- sort(all words)
- sort(the word list)
Using arrays this would be fairly simple.
Using byte of math you could also reduce the length of the target list before the loop up:
by calculating the average of all numbers in the list you can discard the upper or lower half of the list.
Am i right or making a mistake?
Fast and easy. Used arrays and regular sorting of letters instead of numbers. Worked perfectly. I have a tendency to make things harder then they are:)
LOL. You got me there. Used VB instead of C++ / Perl who are much sexier. I know. I am an opportunist and I will use whatever gets the job done at minimal effort. VB was fast, forgiving with arrays/data typing and it did the trick. If speed and 100% accuracy was crucial I would have done it in C++.