Update bubble_sort.py

Author: cclauss

Diff for: sorts/bubble_sort.py

@@ -106,28 +106,25 @@ def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
 
 if __name__ == "__main__":
     import doctest
+    from random import sample
     from timeit import timeit
 
     doctest.testmod()
 
-    user_input = input("Enter numbers separated by a comma:").strip()
-    unsorted = [
-        int(item) if isinstance(item, int) else float(item)
-        for item in user_input.split(",")
-    ]
-
-    num_runs = 1000
+    # 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
     )
-    timer_recursive = timeit(
-        "bubble_sort_recursive(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")
+    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")
+    print(f"Processing time (recursive): {timer_recursive:.5f}s for {num_runs:,} runs")