This chapter builds on the techniques of object-oriented programming and unit testing that were used in Chapter 10 and introduces a new programming technique, recursion . The problem that we will solve is the following: given any English word, what are all the anagrams of it?
11.1 Main Classes
Suppose that we want to find all the anagrams of some given word. One approach is as follows: first, we work out all of the different ways of rearranging the letters in the word, and then we check each arrangement against a list of known ...
