Short Proofs for Cut-and-Paste Sorting of Permutations

Details Short Proofs for Cut-and-Paste Sorting of Permutations Short Proofs for Cut-and-Paste Sorting of Permutations

2006-05-03

arxiv.org/abs/math/0605084v1

Discrete Math. Vol. 307, no. 22, 2007, pp. 2866-2870

Mathematics

Combinatorics

7 pages, 2 figures

Scientific paper

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give short proofs that every permutation of $[n]$ can be transformed to the identity in at most $\flr{2n/3}$ such moves and that some permutations require at least $\flr{n/2}$ moves.

Affiliated with

Also associated with

No associations

Rating

Short Proofs for Cut-and-Paste Sorting of Permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Short Proofs for Cut-and-Paste Sorting of Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short Proofs for Cut-and-Paste Sorting of Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307419