Ok, newbie here but looking at the process, it seems kind of dumb
You guys turn a word list into a hash list and then compare it one by one to the original hash, right?
Would it not be simpler just to use the find function (like in word)? If we start with hash A, then FIND the string in the hash list....instead of comparing each one individually.
Newbie, so let me know