Pancake sorting

Pancake sorting is the mathematical problem of sorting a disordered stack of pancakes in order of size when a <a href="/facts/Spatula/t5MQxDao">spatula</a> can be inserted at any point in the stack and used to flip all pancakes above it. A pancake number is the minimum number of flips required for a given number of pancakes. In this form, the problem was first discussed by American geometer <a href="/facts/Jacob_E._Goodman/3rda4H2v">Jacob E. Goodman</a>. A variant of the problem is concerned with burnt pancakes, where each pancake has a burnt side and all pancakes must, in addition, end up with the burnt side on bottom.
All sorting methods require pairs of elements to be compared. For the traditional <a href="/facts/Sorting_problem/PwHpj1Gs">sorting problem</a>, the usual problem studied is to minimize the <a href="/facts/Comparison_sort/X1PvE50c">number of comparisons required to sort a list</a>. The number of actual operations, such as swapping two elements, is then irrelevant. For pancake sorting problems, in contrast, the aim is to minimize the number of operations, where the only allowed operations are reversals of the elements of some <a href="/facts/Prefix_(computer_science)/dM5Rqg6X">prefix</a> of the sequence. Now, the number of comparisons is irrelevant.

Pancake sorting open-in-new

Pancake sorting