mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
c909da9b08
* pre-commit: Upgrade psf/black for stable style 2023 Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`. * https://github.com/psf/black/blob/main/CHANGES.md#2310 > This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style… Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit. I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
40 lines
973 B
Python
40 lines
973 B
Python
def stooge_sort(arr):
|
|
"""
|
|
Examples:
|
|
>>> stooge_sort([18.1, 0, -7.1, -1, 2, 2])
|
|
[-7.1, -1, 0, 2, 2, 18.1]
|
|
|
|
>>> stooge_sort([])
|
|
[]
|
|
"""
|
|
stooge(arr, 0, len(arr) - 1)
|
|
return arr
|
|
|
|
|
|
def stooge(arr, i, h):
|
|
if i >= h:
|
|
return
|
|
|
|
# If first element is smaller than the last then swap them
|
|
if arr[i] > arr[h]:
|
|
arr[i], arr[h] = arr[h], arr[i]
|
|
|
|
# If there are more than 2 elements in the array
|
|
if h - i + 1 > 2:
|
|
t = (int)((h - i + 1) / 3)
|
|
|
|
# Recursively sort first 2/3 elements
|
|
stooge(arr, i, (h - t))
|
|
|
|
# Recursively sort last 2/3 elements
|
|
stooge(arr, i + t, (h))
|
|
|
|
# Recursively sort first 2/3 elements
|
|
stooge(arr, i, (h - t))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
user_input = input("Enter numbers separated by a comma:\n").strip()
|
|
unsorted = [int(item) for item in user_input.split(",")]
|
|
print(stooge_sort(unsorted))
|