Given permutations $\pi$ and $\gamma$, a sorting reversal applied to $\pi$ decreases the reversal
distance with respect to $\gamma$ by 1. Therefore, a sorting reversal must necessarily
belong to a minimum collection of reversals sorting $\pi$ into $\gamma$.