2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/163080We 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.7 pagesCombinatorics68R05text