Flip-sort animations

Flip-sort is a fascinating simple process: each iteration consists into a flip of the downward runs (i.e., a pop-stack sort).
Towards a linear-time sorting algorithms? 😉 Each permutation is sorted in less than n-1 iterations of this process!
We (Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl, Svante Linusson)
analyse different aspects of this process in our articles:
- Pop-stack sorting and its image (Proceedings of the conference Eurocomb 2019, Acta Math. Univ. Comenianae Vol. LXXXVIII, 3 (2019), pp. 395–402),
- Flip-sort and extremal cases of pop-stack sorting (small article for the conference Permutation Patterns 2019),
- Flip-sort and combinatorial aspects of pop-stack sorting (longer article for the journal DMTCS, 2020).