mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-09-28 21:45:27 +08:00
58 lines
1.4 KiB
Python
58 lines
1.4 KiB
Python
from typing import Protocol
|
|
|
|
|
|
class Comparable(Protocol):
|
|
def __lt__(self, other: object, /) -> bool: ...
|
|
|
|
|
|
def stooge_sort[T: Comparable](arr: list[T]) -> list[T]:
|
|
"""
|
|
Examples:
|
|
>>> stooge_sort([18.1, 0, -7.1, -1, 2, 2])
|
|
[-7.1, -1, 0, 2, 2, 18.1]
|
|
|
|
>>> stooge_sort([])
|
|
[]
|
|
|
|
>>> stooge_sort(["c", "a", "b"])
|
|
['a', 'b', 'c']
|
|
|
|
>>> stooge_sort([2.5, -1, 0.0])
|
|
[-1, 0.0, 2.5]
|
|
|
|
>>> stooge_sort([1, "a"])
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: '<' not supported between instances of 'str' and 'int'
|
|
"""
|
|
stooge(arr, 0, len(arr) - 1)
|
|
return arr
|
|
|
|
|
|
def stooge[T: Comparable](arr: list[T], i: int, h: int) -> None:
|
|
if i >= h:
|
|
return
|
|
|
|
# If first element is smaller than the last then swap them
|
|
if arr[h] < arr[i]:
|
|
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))
|