Source: wikibot/cycle-sort
= Cycle sort
{wiki=Cycle_sort}
Cycle sort is a highly efficient, in-place sorting algorithm that is particularly notable for its minimal number of writes to the original array. It is based on the concept of finding cycles in the array and rearranging the elements in a way that each cycle is sorted correctly with minimal data movement. \#\#\# Key Characteristics of Cycle Sort: 1. **In-place**: It requires no additional storage space, making it memory efficient.