⚡️ Speed up method BubbleSorter.sorter by 144%

Here's an optimized version of your program. Improvements.

- Reduce repeated computation of `len(arr)` in loops.
- Make the bubble sort algorithm more efficient by stopping when no swaps occur (early exit).
- Remove unnecessary variable assignments (`temp`).


This is still bubble sort (for correctness), but with early-termination and less memory/operations. The function signatures, return values, and comments are preserved as requested.

Author: codeflash-ai[bot]

code_to_optimize/bubble_sort_method.py

@@ -7,11 +7,14 @@ def __init__(self, x=0):
 
     def sorter(self, arr):
         print("codeflash stdout : BubbleSorter.sorter() called")
-        for i in range(len(arr)):
-            for j in range(len(arr) - 1):
+        n = len(arr)
+        for i in range(n):
+            swapped = False  # Early exit if no elements were swapped
+            for j in range(n - 1 - i):  # Skip the last i elements (already sorted)
                 if arr[j] > arr[j + 1]:
-                    temp = arr[j]
-                    arr[j] = arr[j + 1]
-                    arr[j + 1] = temp
+                    arr[j], arr[j + 1] = arr[j + 1], arr[j]
+                    swapped = True
+            if not swapped:
+                break
         print("stderr test", file=sys.stderr)
         return arr