Cycle Sort Algorithm

Cycle sort is an in-place, unstable comparison sort that is theoretically optimal in terms of the total number of writes it makes to the array being sorted. It works on the idea that the permutation needed to sort the array can be factored into disjoint cycles, each of which can be individually rotated into place, so every element is written to its final position exactly once.