Feature: Cyclic Sort

[sharansukesh1003]

Feature description

Cyclic Sort is a simple yet efficient in-place sorting algorithm that works on the principle of mapping each element to its correct position. It achieves this by iterating through the array and placing each element at its rightful place, effectively sorting the entire array. The algorithm's distinctive feature is its constant space complexity, making it ideal for situations where memory usage is a concern. Despite its basic concept, Cyclic Sort offers a reliable and straightforward approach to sorting arrays in linear time complexity, making it a valuable addition to sorting algorithms.

[tianyizheng02]

Once again, we already have an implementation of this: sorts/cycle_sort.py. And once again, please check if an algorithm is already implemented.

Also, if you do want to contribute an algorithm, why open an issue for it? Like the contributing guidelines say (which you should've read already), you can just open a PR.

[sharansukesh1003]

For your information, cycle and cyclic sort are two different things. https://en.wikipedia.org/wiki/Cycle_sort https://blog.stackademic.com/coding-pattern-cyclic-sort-96511b0f60ac

…

On Sun, Oct 1, 2023 at 3:22 PM Tianyi Zheng ***@***.***> wrote: Once again, we already have an implementation of this: sorts/cycle_sort.py <https://github.com/TheAlgorithms/Python/blob/eaa87bd791cdc18d210d775f3258767751f9d3fe/sorts/cycle_sort.py>. And once again, please check if an algorithm is already implemented. Also, if you do want to contribute an algorithm, why open an issue for it? Like the contributing guidelines say (which you should've read already), you can just open a PR. — Reply to this email directly, view it on GitHub <#9251 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/ASOEZSAZ5TWBBISDP7EZEJTX5E4PHANCNFSM6AAAAAA5OGJ5B4> . You are receiving this because you authored the thread.Message ID: ***@***.***>

[tianyizheng02]

Literally the first line of the Stackademic article you cite:

Cycle sort is an in-place sorting algorithm.

Wikipedia: "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."
Stackademic: "It is based on the idea that the array to be sorted can be divided into cycles. Cycles can be visualized as a graph."

The Stackademic article uses "cycle sort" and "cyclic sort" interchangeably.

[sharansukesh1003]

Cycle sort and cyclic sort are related sorting algorithms, but they are not exactly the same thing. Cyclic Sort: Cyclic sort is a comparison-based sorting algorithm that works on the principle of cycling through the elements to arrange them in the correct order. The basic idea behind cyclic sort is to iterate through the array, place each element in its correct position by swapping it with the element currently at that position. Cyclic sort assumes that the elements to be sorted are integers in a specific range. It has a time complexity of O(n) but requires O(1) additional space. Cycle Sort: Cycle sort is also a comparison-based in-place sorting algorithm. It is based on the idea of finding cycles in the permutation being sorted. It achieves this by rotating elements within the cycle to their correct position. Cycle sort can be used for sorting data in memory with very limited auxiliary space requirements, making it useful for memory-constrained environments. It also has a time complexity of O(n^2) in the worst case. In summary, cyclic sort is a specific sorting technique where elements are placed in their correct position by cycling through the array, while cycle sort is a broader sorting algorithm that involves identifying and rotating cycles in the permutation being sorted. The terms are related, but they refer to different concepts in sorting algorithms.

…

On Sun, Oct 1, 2023 at 3:58 PM Tianyi Zheng ***@***.***> wrote: Literally the first line of the Stackademic article you cite: Cycle sort is an in-place sorting algorithm. Wikipedia: "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." Stackademic: "It is based on the idea that the array to be sorted can be divided into cycles. Cycles can be visualized as a graph." — Reply to this email directly, view it on GitHub <#9251 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/ASOEZSCRDUJPGMP3V2GRSNLX5FAUHANCNFSM6AAAAAA5OGJ5B4> . You are receiving this because you authored the thread.Message ID: ***@***.***>