Sorting a Permutation by block moves
classification
🧮 math.CO
keywords
blockmovespermutationresultssortingboundcontrastexisting
read the original abstract
We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.