forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdesc.json
More file actions
13 lines (13 loc) · 640 Bytes
/
desc.json
File metadata and controls
13 lines (13 loc) · 640 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
{
"Cycle Sort": "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.",
"Complexity": {
"time": "worst $O(n^2)$, best $O(n^2)$, average $O(n^2)$",
"space": "worst $O(1)$ auxiliary"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Cycle_sort'>Wikipedia</a>"
],
"files": {
"basic": "Cycle Sort"
}
}