⚡️ Speed up function sorter by 400,759%

The given code sorts a list using a bubble sort algorithm, which has a time complexity of \( O(n^2) \). To improve its performance, we can use the built-in Python sorting function, which uses Timsort and has an average time complexity of \( O(n \log n) \). 

Here's the optimized version of the program.

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