⚡️ Speed up function sorter by 125,980%

Here’s a **faster** rewrite of your function, using Python's built-in `list.sort()` method, which is implemented in C and highly optimized (Timsort algorithm). The functionality (in terms of output and in-place sorting) and print statements are preserved.



---

### Why it's faster

- The old approach is a pure-Python bubble sort O(N²); `list.sort()` is O(N log N) for most inputs and runs in optimized C code.
- The result and printed output are unchanged, as required.

---

If, for some reason, you **must not** use built-in sort and need a manual fast implementation, a simple in-place quicksort or mergesort would still be much faster than bubble sort. **But `arr.sort()` is fastest and most idiomatic in Python.**

Author: codeflash-ai[bot]

code_to_optimize/bubble_sort.py

@@ -1,10 +1,5 @@
 def sorter(arr):
     print("codeflash stdout: Sorting list")
-    for i in range(len(arr)):
-        for j in range(len(arr) - 1):
-            if arr[j] > arr[j + 1]:
-                temp = arr[j]
-                arr[j] = arr[j + 1]
-                arr[j + 1] = temp
+    arr.sort()  # much faster than nested loops
     print(f"result: {arr}")
     return arr