A recursive anagram solver with brute-force dictionary checking implemented in Python
For longer words, the latter is the most time-consuming. Future plans include the implementation of a red/black tree for the dictionary file, to significantly decrease the processing time. Multiple-word anagrams are also a desirable feature, though their length would likely be prohibitive until the first issue (processing time) is resolved somewhat.
In a hurry? Add it to your Download Basket!
What's New in This Release:
- Fulfills the centerpiece of its functionality, but not gracefully, and with very few frills.