Pancakes with a Problem：有问题的煎饼.pptVIP

Steven Rudich: /~rudich Pancakes With A Problem! Course Staff Profs: Anupam Gupta John Lafferty TAs: Kanat Tangwongsan Yinmeng Zhang /~15251 Please check the webpages regularly! Course DocumentYou must read this carefully. Grading formula for the course. 40% homework 5% in-class quizzes 25% in-recitation tests 30% final Seven points a day late penalty. Collaboration/Cheating Policy You may NOT share written work. We reuse homework problems. Pancakes With A Problem! Developing A Notation:Turning pancakes into numbers Developing A Notation:Turning pancakes into numbers Developing A Notation:Turning pancakes into numbers Developing A Notation:Turning pancakes into numbers How do we sort this stack?How many flips do we need? 4 Flips Are Sufficient Algebraic Representation Algebraic Representation 4 Flips are necessary in this case 5th Pancake Number 5th Pancake Number The 5th Pancake Number: The MAX of the X’s The 5th Pancake Number: The MAX of the X’s P5 = MAX over s2 stacks of 5 of MIN # of flips to sort s Pn = MAX over s2 stacks of n pancakes of MIN # of flips to sort s Pn = MAX over s2 stacks of n pancakes of MIN # of flips to sort s Pn = The number of flips required to sort a worst-case stack of n pancakes. What is Pn for small n? Initial Values Of Pn P3 = 3 132 requires 3 Flips, hence P3 ≥ 3. ANY stack of 3 can be done by getting the big one to the bottom (≤ 2 flips), and then using ≤ 1 extra flip to handle the top two. Hence, P3 = 3. nth Pancake Number Bracketing:What are the best lower and upper bounds that I can prove? ? ? Pn ? ? Bring-to-top Method Upper Bound On Pn:Bring To Top Method For n Pancakes If n=1, no work required - we are done! Otherwise, flip pancake n to top and  then flip it to position n. Now use: Better Upper Bound On Pn:Bring To Top Method For n Pancakes If n=2, at most one flip and we are done. Otherwise, flip pancake n to top and  then flip it to position n. Now use: Bring to top not a