Among the sorting algorithms that we generally study in our data structure and algorithm courses, Selection Sort makes least number of writes (it makes O(n) swaps). But, Cycle Sort almost always makes less number of writes compared to Selection Sort. In Cycle Sort, 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.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
- Cycle Sort
- Lower bound for comparison based sorting algorithms
- Merge Sort for Linked Lists
- Sort an array of 0s, 1s and 2s
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Sorting without comparison of elements
- Sort 3 numbers
- Merge Sort with O(1) extra space merge and O(n lg n) time
- Sorting in Java