⚡️ Speed up function sorter by 140,926%

Here’s a faster version using Python’s built-in `sort` method. The original code did a bubble sort, which is O(n²); the built-in sort is Timsort (O(n log n)), making it much faster and using less memory by not making unnecessary variable copies.

All print statements and return values are preserved.


This will give identical output and results, but with significantly improved speed and lower memory usage.

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