  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.
