HW Number 3

• You are working in teams with the goal of vigorous discussion about the concepts. This will require workplace-style maturity.
• Do not divide up the problems, please discuss each problem with your partner.
• Use one side of one piece of paper per problem. This is to avoid novella answers. You can not answer two problems on one piece of paper by having a solution on the front and a solution on the back (to ease grading).
• Write the name of all team members on each assignment, specify which person is doing the writing.
• Don't do all of the work for your partner. Don't let your partner do all of the work. If you need a new partner let me know, I will not engage in conflict resolution. I will frown on all partner split-ups regardless of blame.

The Problems (taken from Skiena's The Algorithm Design Manual 2nd Edition)

1. 5-6
2. 5-4
3. 5-10
4. 5-17
5. 5-23
6. Extra Credit: email me working code for programming challenge 5-5 "Tower of Cubes" (UVA judge 10051). For flavor:

   In this problem you are given N colorful cubes each having a distinct weight. Each face of a cube is colored with one color. Your job is to build a tower using the cubes you have subject to the following restrictions:

   • Never put a heavier cube on a lighter one.
   • The bottom face of every cube (except the bottom cube, which is lying on the floor) must have the same color as the top face of the cube below it.
   • Construct the tallest tower possible.