⚡️ Speed up function sorter by 87%

Certainly! Your code is a classic **bubble sort** implementation with two major performance issues.
- It never checks if the array is already sorted in a pass, so it does the maximum number of iterations.
- It redundantly computes `len(arr)` every inner-loop.
- Bubble sort is inherently slow — but you require an in-place sort and the result must be the same, so we can improve with some key optimizations.

### Optimized Bubble Sort
Improvements.
1. **Early exit:** Stop if no swaps occurred (array is sorted).
2. **Reduce inner loop range each time:** The last elements are already sorted after each pass.
3. **Direct tuple-swap:** Use Python's multiple assignment swap for speed.
4. **Pre-compute `len(arr)`:** Only compute once.

Here is the **optimized version** preserving all your prints and output.



### Explanation of changes
- **`swapped` check:** If no swaps in an outer pass, break for a big speed boost on nearly-sorted data.
- **`range(n - i - 1)`:** Each pass pushes the next-largest value into place, so inner loop shortens.
- **Tuple swap:** Faster than three assignments.
- **No unnecessary calls to `len()` in loop.**

This is the fastest bubble-sort possible without changing the algorithm (still in-place, correct result).

**If you want even faster code, and are allowed to use Python's built-in sort**, you could simply use `arr.sort()`, but as per your request, this implements only the algorithmic optimization of what you already have.

Author: codeflash-ai[bot]

code_to_optimize/bubble_sort.py

@@ -1,10 +1,13 @@
 def sorter(arr):
     print("codeflash stdout: Sorting list")
-    for i in range(len(arr)):
-        for j in range(len(arr) - 1):
+    n = len(arr)
+    for i in range(n):
+        swapped = False
+        for j in range(n - i - 1):
             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]  # faster swap
+                swapped = True
+        if not swapped:
+            break  # array is sorted
     print(f"result: {arr}")
     return arr