Here's what I have so far.
The program is made to determine whether or not a
word is abecedarian, and works in that sense. However, I am planning on reusing a partial of the code for enumerating the letters, which I can't do right now because that code is a jumbled mess. Basically, I need to parse 'abecedarian' finder code from the letter enumeration code.
Thanks for the quick reply
-Kevan
[ EJFH: Break up long comments ]