Tag Archives: Anagram

Pipe-and-Filter Architecture and An Elegant Algorithm

The Problem: Given a dictionary of words in English, find all the anagrams in the dictionary. That is, find all the words that are permutations of each other. For example, pots, stop, and spot are anagrams of each other. Bentley, … Continue reading

Posted in Algorithm Analysis, General Concepts, Links, Software Architecture | Tagged , , , | Leave a comment