Title of article
Greedy Pancake Flipping
Author/Authors
Williams، نويسنده , , Aaron and Sawada، نويسنده , , Joe، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
6
From page
357
To page
362
Abstract
We prove that a stack of pancakes can be rearranged in all possible ways by a greedy process: Flip the maximum number of topmost pancakes that gives a new stack. We also show that the previous Gray code for rearranging pancakes (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196-204) is a greedy process: Flip the minimum number of topmost pancakes that gives a new stack.
Keywords
Gray code , Permutations , prefix-reversal , Greedy algorithm , pancake sorting
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2013
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456487
Link To Document