⚡️ Speed up function sorter by 101%

The optimized bubble sort implements three key performance improvements:

**1. Reduced Inner Loop Range**: The inner loop uses `range(len(arr) - 1 - i)` instead of `range(len(arr) - 1)`. This avoids redundant comparisons since after each outer loop iteration, the largest `i` elements are already in their final sorted positions at the end of the array.

**2. Early Termination**: Added a `swapped` flag that tracks whether any swaps occurred during a pass. If no swaps happen, the array is already sorted and the algorithm breaks early. This provides massive speedups for already-sorted or partially-sorted data.

**3. Tuple Swap**: Replaced the 3-line temporary variable swap with Python's tuple assignment `arr[j], arr[j + 1] = arr[j + 1], arr[j]`, which is more efficient at the bytecode level.

**Performance Impact**: The test results show the optimization is particularly effective for:
- **Already sorted lists**: 95,776% faster (55.6ms → 58.0μs) - early termination eliminates all unnecessary passes
- **Lists with duplicates**: 101-131% faster - fewer comparisons needed due to reduced inner loop
- **Partially sorted data**: 79.2% faster for already sorted with duplicates - early termination kicks in quickly

Even worst-case scenarios (reverse sorted) see 58-59% improvement due to the reduced inner loop range, while maintaining the same O(n²) complexity.

Author: codeflash-ai[bot]

code_to_optimize/bubble_sort_codeflash_trace.py

@@ -1,14 +1,19 @@
 from codeflash.benchmarking.codeflash_trace import codeflash_trace
+
+
 @codeflash_trace
 def sorter(arr):
     for i in range(len(arr)):
-        for j in range(len(arr) - 1):
+        swapped = False
+        for j in range(len(arr) - 1 - i):
             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
     return arr
 
+
 @codeflash_trace
 def recursive_bubble_sort(arr, n=None):
     # Initialize n if not provided
@@ -27,10 +32,12 @@ def recursive_bubble_sort(arr, n=None):
     # Recursively sort the remaining n-1 elements
     return recursive_bubble_sort(arr, n - 1)
 
+
 class Sorter:
     @codeflash_trace
     def __init__(self, arr):
         self.arr = arr
+
     @codeflash_trace
     def sorter(self, multiplier):
         for i in range(len(self.arr)):