Sort Sprint

Tap two bars to swap them. Sort ascending in as few swaps as possible.

The optimal swap count = n − (number of permutation cycles). Any-two-elements swaps allowed.