CS 3341, Recitation Section, Problem list 5.  For Feb 17, 19.

Work on Problem 10 of Section 5.6 (page 190),
the "Flipping Pancakes" Problem.

Here is a statement of the problem:

   There are n pancakes all of different sizes that
   are stacked on top of each other.  You are allowed
   to slip a flipper under one of the pancakes and
   flip over the whole stack above the flipper.
   The purpose is to arrange the pancakes according
   to their size with the biggest at the bottom.
   Design an algorithm to solve this puzzle.
   Determine the asymptotic performance of your
   algorithm as well as you can.
   
   Use the following two criteria for performance,
   each expressed in terms of n:
     1. Worst case number of flips required.
     2. Worst case total number of pancakes that
        have to be flipped.

You might try some simple examples first,
but you should end up with a general algorithm
that will always work.