Sorting a Permutation by block moves

Details Sorting a Permutation by block moves Sorting a Permutation by block moves

2008-06-17

arxiv.org/abs/0806.2787v1

Mathematics

Combinatorics

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sorting a Permutation by block moves 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 Sorting a Permutation by block moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting a Permutation by block moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408907