GitHub - areinisc/anagrams: lab08 - finds the number of solutions to a queue permutation problem

areinisc / anagrams Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

lab08 - finds the number of solutions to a queue permutation problem

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
README		README
anagrams.cpp		anagrams.cpp
makefile		makefile

Repository files navigation

    _                                              
   / \   _ __   __ _  __ _ _ __ __ _ _ __ ___  ___ 
  / _ \ | '_ \ / _` |/ _` | '__/ _` | '_ ` _ \/ __|
 / ___ \| | | | (_| | (_| | | | (_| | | | | | \__ \
/_/   \_\_| |_|\__,_|\__, |_|  \__,_|_| |_| |_|___/
                     |___/                         
Author(s): Alex Reinisch, Nick Walker
Date(s): 27-30 March 2012

Summary:
    We recursively call a method 'solve' to find all possible permutations of pushes and pops that will create a given output string from a given input string. This implementation expects to be told the number of input/output pairs it will test and then repeats its solving method for each pair.

Comments:
*   I've set up a git repo for our code.
*   Done with skeleton code.
*   First draft complete. Solve should work. I think everything should work. Let's get ready to fix it.
*   Basic fixes made. Won't compile. Angry about the difference between const char and const char*. I'll ask Dr. Goldwasser what's going on.
*   Making new local variables to pass changed values in recursion calls.
*   Success on examples! Version 1.0.0 complete.