The original pancake problem
The minimum number of flips required to sort any stack of n pancakes has been shown to lie between 15/14n and 18/11n (approximately 1.07n and 1.64n), but the exact value is not … See more

The discussion above presumes that each pancake is unique, that is, the sequence on which the prefix reversals are performed is a See more

An n-pancake graph is a graph whose vertices are the permutations of n symbols from 1 to n and its edges are given between … See more

Number of stacks of given height n that require unique flips k to get sorted Height n k 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 1 2 1 1 3 1 2 2 1 4 1 3 6 11 3 5 1 4 12 35 48 20 6 1 5 20 79 199 … See more

The pancake sorting problem was first posed by Jacob E. Goodman, writing under the pseudonym "Harry Dweighter" ("harried waiter"). See more

An example of the pancake sorting algorithm is given below in Python. The code is similar to bubble sort or selection sort See more

• Chitturi, B.; Sudborough, H. (2010). "Prefix Reversals on Strings". Proceedings of the International Conference on Bioinformatics & … See more