Anagrams is a student project for use in CS 1 / CS 2 courses including CS 211 at University of Oregon. It is inspired by the anagrams project contributed to the Stanford Nifty Projects collection by Stuart Reges, although the implementation and instructions were independently developed at University of Oregon my Michal Young.
- Exercise in creation of a collection class (a bag of letters) designed to be useful for a particular algorithm.
- Recursive solution of an enumeration problem.
- Aliasing issues and their resolution by copying mutable data structures.
Detailed instructions for completion are in docs/HOWTO-anagram.md.