This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations.(July 2017) (Learn how and when to remove this message)
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Cycle sort" – news · newspapers · books · scholar · JSTOR(July 2017) (Learn how and when to remove this message)
(Learn how and when to remove this message)
Cycle sort
Example of cycle sort sorting a list of random numbers.
Example of cycle sort sorting a list of random numbers.
Class
Sorting algorithm
Data structure
Array
Worst-case performance
Θ(n2)
Best-case performance
Θ(n2)
Average performance
Θ(n2)
Worst-case space complexity
Θ(n) total, Θ(1) auxiliary
Optimal
No
Cycle sort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original array, unlike any other in-place sorting algorithm. It is based on the idea that the permutation to be sorted can be factored into cycles, which can individually be rotated to give a sorted result.
Unlike nearly every other sort, items are never written elsewhere in the array simply to push them out of the way of the action. Each value is either written zero times, if it's already in its correct position, or written one time to its correct position. This matches the minimal number of overwrites required for a completed in-place sort.
Minimizing the number of writes is useful when making writes to some huge data set is very expensive, such as with EEPROMs like Flash memory where each write reduces the lifespan of the memory.
Cyclesort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original...
exchange, selection, merging, etc. Exchange sorts include bubble sort and quicksort. Selection sorts include cyclesort and heapsort. Whether the algorithm is...
two writes), this is roughly twice the theoretical minimum achieved by cyclesort, which performs at most n writes. This can be important if writes are...
For this reason, radix sort has also been called bucket sort and digital sort. Radix sort can be applied to data that can be sorted lexicographically, be...
must have at least one cycle and therefore a topological sort is impossible. Reflecting the non-uniqueness of the resulting sort, the structure S can be...
well-defined concept. Cyclesort – a sorting algorithm that is based on the idea that the permutation to be sorted can be factored into cycles, which can individually...
Tournament sort is a sorting algorithm. It improves upon the naive selection sort by using a priority queue to find the next element in the sort. In the...
traverse it to create sorted list Cyclesort: in-place with theoretically optimal number of writes Merge sorts Merge sort: sort the first and second half...
The Atkinson-cycle engine is a type of internal combustion engine invented by James Atkinson in 1882. The Atkinson cycle is designed to provide efficiency...
but reverses both choices; that is, each cycle lists its minimal element first, and the cycles are sorted in decreasing order of their minimal elements...
called "Terra" in the Cycle, is mentioned as one of the failed civilizations. In City of Illusions, Earth has suffered some sort of collapse in a distant...
products. It is also known as the Shewhart cycle, or the control circle/cycle. Another version of this PDCA cycle is OPDCA. The added "O" stands for observation...
permutation in cycle notation with the smallest position in each cycle first, and the cyclessorted in increasing order. For each cycle, replace each number...
9999. This date ordering makes computerized sorting of dates easier by avoiding the need for a separate sorting algorithm. The monoid of words over an alphabet...
A song cycle (German: Liederkreis or Liederzyklus) is a group, or cycle, of individually complete songs designed to be performed in sequence, as a unit...
The Pilate cycle is a group of various pieces of early Christian literature that purport to either be written by Pontius Pilate, or else otherwise closely...
Interpolation sort is a sorting algorithm that is a kind of bucket sort. It uses an interpolation formula to assign data to the bucket. A general interpolation...
various sorting algorithms, most famously merge sort. The merge algorithm plays a critical role in the merge sort algorithm, a comparison-based sorting algorithm...
New Woman that he pursues wears Rational Dress of a sort that scandalised society but made cycling much easier. The Rational Dress Society was founded...
OCBC Cycle is an annual mass-participation cycling event held on closed public roads in Singapore. The event is organised by OCBC Bank. The event also...
Endosomes are a collection of intracellular sorting organelles in eukaryotic cells. They are parts of endocytic membrane transport pathway originating...
and clinical trials. Uses for flow cytometry include: Cell counting Cell sorting Determining cell characteristics and function Detecting microorganisms...
nutrients is cyclic. Mineral cycles include the carbon cycle, sulfur cycle, nitrogen cycle, water cycle, phosphorus cycle, oxygen cycle, among others that continually...
Global Information
