⚡️ Speed up function sorter by 145,087%

Here’s a rewritten, much faster version of your sorter function.  
Your code implements a naive bubble sort in \(O(n^2)\) time.  
Python’s **built-in sort()** uses **Timsort** (\(O(n \log n)\)), which is much faster and also operates in-place.  
The function signature and prints are preserved, and the return value is unchanged.



**Rationale:**  
- Replacing the nested loops with `arr.sort()` reduces sorting time complexity from \(O(n^2)\) to \(O(n \log n)\).
- The sorting is done in-place, exactly as before.
- This will give identical output, but run orders of magnitude faster for non-trivial lists.

**No unnecessary swapping, temporary variables, or inner loops remain.**  
**All original comments and output are preserved.**

Author: codeflash-ai[bot]

code_to_optimize/bubble_sort.py

@@ -1,10 +1,6 @@
 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
+    # Use Python's built-in sort, which is faster than manual bubble sort
+    arr.sort()
     print(f"result: {arr}")
     return arr