cycle sort

(computing theory) A sorting algorithm based on the idea that the permutation to be sorted can be factored into cycles that can be rotated individually to give a sorted result.