From 8d44c4e5e9fbc341f64621b99154ec299855a697 Mon Sep 17 00:00:00 2001 From: anumolusneha <2400032254@kluniversity.in> Date: Fri, 31 Oct 2025 23:00:33 +0530 Subject: [PATCH 1/3] Add bubble sort algorithm in Python --- sorts/bubble_sort.py | 137 ++++--------------------------------------- 1 file changed, 10 insertions(+), 127 deletions(-) diff --git a/sorts/bubble_sort.py b/sorts/bubble_sort.py index 9ec3d5384f38..65a7342f3edc 100644 --- a/sorts/bubble_sort.py +++ b/sorts/bubble_sort.py @@ -1,132 +1,15 @@ -from typing import Any - - -def bubble_sort_iterative(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_iterative([0, 5, 2, 3, 2]) - [0, 2, 2, 3, 5] - >>> bubble_sort_iterative([]) - [] - >>> bubble_sort_iterative([-2, -45, -5]) - [-45, -5, -2] - >>> bubble_sort_iterative([-23, 0, 6, -4, 34]) - [-23, -4, 0, 6, 34] - >>> bubble_sort_iterative([0, 5, 2, 3, 2]) == sorted([0, 5, 2, 3, 2]) - True - >>> bubble_sort_iterative([]) == sorted([]) - True - >>> bubble_sort_iterative([-2, -45, -5]) == sorted([-2, -45, -5]) - True - >>> bubble_sort_iterative([-23, 0, 6, -4, 34]) == sorted([-23, 0, 6, -4, 34]) - True - >>> bubble_sort_iterative(['d', 'a', 'b', 'e']) == sorted(['d', 'a', 'b', 'e']) - True - >>> bubble_sort_iterative(['z', 'a', 'y', 'b', 'x', 'c']) - ['a', 'b', 'c', 'x', 'y', 'z'] - >>> bubble_sort_iterative([1.1, 3.3, 5.5, 7.7, 2.2, 4.4, 6.6]) - [1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7] - >>> bubble_sort_iterative([1, 3.3, 5, 7.7, 2, 4.4, 6]) - [1, 2, 3.3, 4.4, 5, 6, 7.7] - >>> import random - >>> collection_arg = random.sample(range(-50, 50), 100) - >>> bubble_sort_iterative(collection_arg) == sorted(collection_arg) - True - >>> import string - >>> collection_arg = random.choices(string.ascii_letters + string.digits, k=100) - >>> bubble_sort_iterative(collection_arg) == sorted(collection_arg) - 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 - - -def bubble_sort_recursive(collection: list[Any]) -> list[Any]: - """It is similar iterative bubble sort but recursive. - - :param collection: mutable ordered sequence of elements - :return: the same list in ascending order - - Examples: - >>> bubble_sort_recursive([0, 5, 2, 3, 2]) - [0, 2, 2, 3, 5] - >>> bubble_sort_iterative([]) - [] - >>> bubble_sort_recursive([-2, -45, -5]) - [-45, -5, -2] - >>> bubble_sort_recursive([-23, 0, 6, -4, 34]) - [-23, -4, 0, 6, 34] - >>> bubble_sort_recursive([0, 5, 2, 3, 2]) == sorted([0, 5, 2, 3, 2]) - True - >>> bubble_sort_recursive([]) == sorted([]) - True - >>> bubble_sort_recursive([-2, -45, -5]) == sorted([-2, -45, -5]) - True - >>> bubble_sort_recursive([-23, 0, 6, -4, 34]) == sorted([-23, 0, 6, -4, 34]) - True - >>> bubble_sort_recursive(['d', 'a', 'b', 'e']) == sorted(['d', 'a', 'b', 'e']) - True - >>> bubble_sort_recursive(['z', 'a', 'y', 'b', 'x', 'c']) - ['a', 'b', 'c', 'x', 'y', 'z'] - >>> bubble_sort_recursive([1.1, 3.3, 5.5, 7.7, 2.2, 4.4, 6.6]) - [1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7] - >>> bubble_sort_recursive([1, 3.3, 5, 7.7, 2, 4.4, 6]) - [1, 2, 3.3, 4.4, 5, 6, 7.7] - >>> bubble_sort_recursive(['a', 'Z', 'B', 'C', 'A', 'c']) - ['A', 'B', 'C', 'Z', 'a', 'c'] - >>> import random - >>> collection_arg = random.sample(range(-50, 50), 100) - >>> bubble_sort_recursive(collection_arg) == sorted(collection_arg) - True - >>> import string - >>> collection_arg = random.choices(string.ascii_letters + string.digits, k=100) - >>> bubble_sort_recursive(collection_arg) == sorted(collection_arg) - True - """ - length = len(collection) - swapped = False - for i in range(length - 1): - if collection[i] > collection[i + 1]: - collection[i], collection[i + 1] = collection[i + 1], collection[i] - swapped = True - - return collection if not swapped else bubble_sort_recursive(collection) +def bubble_sort(arr): + n = len(arr) + for i in range(n - 1): + for j in range(0, n - i - 1): + if arr[j] > arr[j + 1]: + arr[j], arr[j + 1] = arr[j + 1], arr[j] + return arr if __name__ == "__main__": - import doctest - from random import sample - from timeit import timeit - - doctest.testmod() + data = [64, 34, 25, 12, 22, 11, 90] + print("Original:", data) + print("Sorted:", bubble_sort(data)) - # Benchmark: Iterative seems slightly faster than recursive. - num_runs = 10_000 - unsorted = sample(range(-50, 50), 100) - timer_iterative = timeit( - "bubble_sort_iterative(unsorted[:])", globals=globals(), number=num_runs - ) - print("\nIterative bubble sort:") - print(*bubble_sort_iterative(unsorted), sep=",") - print(f"Processing time (iterative): {timer_iterative:.5f}s for {num_runs:,} runs") - unsorted = sample(range(-50, 50), 100) - timer_recursive = timeit( - "bubble_sort_recursive(unsorted[:])", globals=globals(), number=num_runs - ) - print("\nRecursive bubble sort:") - print(*bubble_sort_recursive(unsorted), sep=",") - print(f"Processing time (recursive): {timer_recursive:.5f}s for {num_runs:,} runs") From dc3422e062e31d039f144ce1a980fd2ee39fef5b Mon Sep 17 00:00:00 2001 From: anumolusneha <2400032254@kluniversity.in> Date: Fri, 31 Oct 2025 23:11:35 +0530 Subject: [PATCH 2/3] Add bubble sort algorithm in Python --- sorts/bubble_sort.py | 15 --------------- sorts/bubble_sort.py.txt | 0 2 files changed, 15 deletions(-) create mode 100644 sorts/bubble_sort.py.txt diff --git a/sorts/bubble_sort.py b/sorts/bubble_sort.py index 65a7342f3edc..e69de29bb2d1 100644 --- a/sorts/bubble_sort.py +++ b/sorts/bubble_sort.py @@ -1,15 +0,0 @@ -def bubble_sort(arr): - n = len(arr) - for i in range(n - 1): - for j in range(0, n - i - 1): - if arr[j] > arr[j + 1]: - arr[j], arr[j + 1] = arr[j + 1], arr[j] - return arr - - -if __name__ == "__main__": - data = [64, 34, 25, 12, 22, 11, 90] - print("Original:", data) - print("Sorted:", bubble_sort(data)) - - diff --git a/sorts/bubble_sort.py.txt b/sorts/bubble_sort.py.txt new file mode 100644 index 000000000000..e69de29bb2d1 From bc863c7181cbb8c75fa62690def28419fc165dec Mon Sep 17 00:00:00 2001 From: anumolusneha <2400032254@kluniversity.in> Date: Fri, 31 Oct 2025 23:22:26 +0530 Subject: [PATCH 3/3] Add bubble sort algorithm in Python --- sorts/bubble_sort.py.txt | 0 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 sorts/bubble_sort.py.txt diff --git a/sorts/bubble_sort.py.txt b/sorts/bubble_sort.py.txt deleted file mode 100644 index e69de29bb2d1..000000000000