mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 05:39:30 +00:00
421ace81ed
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.0.285 → v0.0.286](https://github.com/astral-sh/ruff-pre-commit/compare/v0.0.285...v0.0.286) - [github.com/tox-dev/pyproject-fmt: 0.13.1 → 1.1.0](https://github.com/tox-dev/pyproject-fmt/compare/0.13.1...1.1.0) * updating DIRECTORY.md * Fis ruff rules PIE808,PLR1714 --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>
54 lines
1.2 KiB
Python
54 lines
1.2 KiB
Python
"""
|
|
Code contributed by Honey Sharma
|
|
Source: https://en.wikipedia.org/wiki/Cycle_sort
|
|
"""
|
|
|
|
|
|
def cycle_sort(array: list) -> list:
|
|
"""
|
|
>>> cycle_sort([4, 3, 2, 1])
|
|
[1, 2, 3, 4]
|
|
|
|
>>> cycle_sort([-4, 20, 0, -50, 100, -1])
|
|
[-50, -4, -1, 0, 20, 100]
|
|
|
|
>>> cycle_sort([-.1, -.2, 1.3, -.8])
|
|
[-0.8, -0.2, -0.1, 1.3]
|
|
|
|
>>> cycle_sort([])
|
|
[]
|
|
"""
|
|
array_len = len(array)
|
|
for cycle_start in range(array_len - 1):
|
|
item = array[cycle_start]
|
|
|
|
pos = cycle_start
|
|
for i in range(cycle_start + 1, array_len):
|
|
if array[i] < item:
|
|
pos += 1
|
|
|
|
if pos == cycle_start:
|
|
continue
|
|
|
|
while item == array[pos]:
|
|
pos += 1
|
|
|
|
array[pos], item = item, array[pos]
|
|
while pos != cycle_start:
|
|
pos = cycle_start
|
|
for i in range(cycle_start + 1, array_len):
|
|
if array[i] < item:
|
|
pos += 1
|
|
|
|
while item == array[pos]:
|
|
pos += 1
|
|
|
|
array[pos], item = item, array[pos]
|
|
|
|
return array
|
|
|
|
|
|
if __name__ == "__main__":
|
|
assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
|
|
assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]
|