mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
56 lines
1.8 KiB
Python
56 lines
1.8 KiB
Python
from typing import Any
|
|
|
|
|
|
def bubble_sort(collection: list[Any]) -> list[Any]:
|
|
"""Pure implementation of bubble sort algorithm in Python
|
|
|
|
:param collection: some mutable ordered collection with heterogeneous
|
|
comparable items inside
|
|
:return: the same collection ordered by ascending
|
|
|
|
Examples:
|
|
>>> bubble_sort([0, 5, 2, 3, 2])
|
|
[0, 2, 2, 3, 5]
|
|
>>> bubble_sort([0, 5, 2, 3, 2]) == sorted([0, 5, 2, 3, 2])
|
|
True
|
|
>>> bubble_sort([]) == sorted([])
|
|
True
|
|
>>> bubble_sort([-2, -45, -5]) == sorted([-2, -45, -5])
|
|
True
|
|
>>> bubble_sort([-23, 0, 6, -4, 34]) == sorted([-23, 0, 6, -4, 34])
|
|
True
|
|
>>> bubble_sort(['d', 'a', 'b', 'e', 'c']) == sorted(['d', 'a', 'b', 'e', 'c'])
|
|
True
|
|
>>> import random
|
|
>>> collection = random.sample(range(-50, 50), 100)
|
|
>>> bubble_sort(collection) == sorted(collection)
|
|
True
|
|
>>> import string
|
|
>>> collection = random.choices(string.ascii_letters + string.digits, k=100)
|
|
>>> bubble_sort(collection) == sorted(collection)
|
|
True
|
|
"""
|
|
length = len(collection)
|
|
for i in reversed(range(length)):
|
|
swapped = False
|
|
for j in range(i):
|
|
if collection[j] > collection[j + 1]:
|
|
swapped = True
|
|
collection[j], collection[j + 1] = collection[j + 1], collection[j]
|
|
if not swapped:
|
|
break # Stop iteration if the collection is sorted.
|
|
return collection
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
import time
|
|
|
|
doctest.testmod()
|
|
|
|
user_input = input("Enter numbers separated by a comma:").strip()
|
|
unsorted = [int(item) for item in user_input.split(",")]
|
|
start = time.process_time()
|
|
print(*bubble_sort(unsorted), sep=",")
|
|
print(f"Processing time: {(time.process_time() - start)%1e9 + 7}")
|