![]() ![]() But then I decided I needed a more interactive solution. At first I wrote Perl filters that would weed through the long lists. Sorting through all the possibilities posed a new challenge. It came up with all the anagrams that would fit a given set of words: this often ran to thousands or hundreds of thousands of anagrams, often pretty unintelligible. The solution came out a few months later and I immediately applied it on the Unix machine I had at work. I got interested in this as a programming topic reading the Programmer’s Challenge in MacTech magazine.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |