Keith Copenhaver

A new lower bound for deterministic pop-stack-sorting

2023 · arXiv (Cornell University)

The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5}n$ for the number of sorts to fully sort a …