Write a C++ Anagram Solver that generates all permutations for a given word (or phrase) and compares these permutations to a dictionary. Assume you have access to a file containing a list of dictionary words. Assume C++ design and readability are more important than execution speed.
Please write your own permutation algorithm – do not use stl next_permutation.
- Provide an implementation for a program that takes characters from argv[1] and outputs to stdout a list of anagrams.
- Would you have written the implementation differently if execution speed was most important?
- What other useful features could you add to this program?
- What was the most difficult part of completing this question?
- If you’d like to: provide an alternative implementation in your favourite language.
- Did you use a computer to do this?
- How long did it take to do this question?
Comments (0)
