Problemintro
Pancake sorting problem
Also called Pancake problem, Pancake sorting, pancake flipping, prefix reversal sorting.
Sort a stack using only prefix reversals; the optimal number of flips is at most about 2n.
Sort a stack using only prefix reversals; the optimal number of flips is at most about 2n.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 7PRWYF Edit this page History Report an error