1. [1] M. Bóna and R. Flynn, “Sorting a Permutation with Block Moves,” arXiv: 0806.2787v1.
2. [2] Conrado Martínez and Uwe Rösler, Partial quicksort and quickpartitionsort, DMTCS Proceedings 01, pp.505-512, 2010.
3. [3] D.W. Cranston, I.H. Sudborough, and D.B. West, “Short Proofs for Cut-and-Paste Sorting of Permutations,” Discrete Mathematics, vol.307, no.22, pp.2866-2870, 2007.
4. [4] C. Daskalakis, R.M. Karp, E. Mossel, S.J. Riesenfeld, and E. Verbin, “Sorting and selection in posets,” SIAM Journal on Computing, vol.40, no.3, pp.597-622, 2011.
5. [5] D.J. Kleitman, E. Kramer, J.H. Conway, S. Bell, and H. Dweighter, “Elementary Problems,” American Mathematical Monthly, vol.82, no.10, pp.1009-1010, 1975.