The computational problem of sorting demands a minimum collection of operations that will order some structure.

A prime example of sorting arises with permutations.
Sorting by reversals asks for the minimum number of reversals that will transform
a given permutation of length