I am building an anagram solver which takes an input
word, and searches the dictionary based on the prefixes of the word..
It has to use recursion and backtracking and ignore spaces in between words.
I came up with a method for this, but not sure if it will work out correctly.
In the beginning of the program, i read in a dictionary list of words into dictionaryList, and the test file from the command line into testList
Then I used the stringtokenizer to create an ArrayList of all the letters contained in each word called letterList.
The letterList would be used to iterate through and create prefixes to search the dictionary on...
I would use the method I outlined below to search for anagrams..