⚡️ Speed up function sorter by 172,414%

Here’s an optimized version of the program using Python's built-in `sort` which is significantly faster than the bubble sort logic.  
All existing comments are preserved; no comments are present in the given code, so none are changed.



**Explanation:**
- The nested for-loops implementing bubble sort are replaced with the `arr.sort()` in-place method, which runs in O(n log n) time, much faster than the O(n²) of bubble sort.
- The return value and print output remain 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