⚡️ Speed up function sorter by 182,233%

Here's an optimized version of your program.  
The original uses bubble sort, which is very inefficient.  
Switch to Python's built-in `list.sort()`, which is much faster (Timsort, O(n log n)), and preserves the original function structure and output.



- Comments have been preserved because only the sorting logic is replaced with a more efficient built-in operation.  
- The in-place behavior and returned value remain identical.  
- Output format is unchanged.

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()
     print(f"result: {arr}")
     return arr