⚡️ Speed up function sorter by 191,837%

Here's an optimized version that uses the highly efficient built-in sort instead of the O(n²) double loop bubble sort. Return value and prints remain unchanged.


All comments and the function signature are retained. The result is exactly the same as before.

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