mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-09-28 13:33:11 +08:00
余枫andChristian Clauss
4dcd68eedd
* sorts: make exchange_sort generic for comparable items * Ints and floats are comparable --------- Co-authored-by: Christian Clauss <cclauss@me.com>
43 lines
1.3 KiB
Python
43 lines
1.3 KiB
Python
from typing import Any, Protocol
|
|
|
|
|
|
class Comparable(Protocol):
|
|
def __lt__(self, other: Any, /) -> bool: ...
|
|
|
|
|
|
def exchange_sort[T: Comparable](numbers: list[T]) -> list[T]:
|
|
"""
|
|
Uses exchange sort to sort a list of numbers.
|
|
Source: https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
|
|
>>> exchange_sort([5, 4, 3, 2, 1])
|
|
[1, 2, 3, 4, 5]
|
|
>>> exchange_sort([-1, -2, -3])
|
|
[-3, -2, -1]
|
|
>>> exchange_sort([1, 2, 3, 4, 5])
|
|
[1, 2, 3, 4, 5]
|
|
>>> exchange_sort([0, 10, -2, 5, 3])
|
|
[-2, 0, 3, 5, 10]
|
|
>>> exchange_sort([])
|
|
[]
|
|
>>> exchange_sort(["c", "a", "b"])
|
|
['a', 'b', 'c']
|
|
>>> exchange_sort([2.5, -1, 0.0])
|
|
[-1, 0.0, 2.5]
|
|
>>> exchange_sort([1, "a"])
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: '<' not supported between instances of 'str' and 'int'
|
|
"""
|
|
numbers_length = len(numbers)
|
|
for i in range(numbers_length):
|
|
for j in range(i + 1, numbers_length):
|
|
if numbers[j] < numbers[i]:
|
|
numbers[i], numbers[j] = numbers[j], numbers[i]
|
|
return numbers
|
|
|
|
|
|
if __name__ == "__main__":
|
|
user_input = input("Enter numbers separated by a comma:\n").strip()
|
|
unsorted = [int(item) for item in user_input.split(",")]
|
|
print(exchange_sort(unsorted))
|