⚡️ Speed up function sorter by 209,041%

Here is a rewritten, faster version of your program.  
**Optimizations:**  
- Uses Python's built-in `sort()` method, which is highly optimized and much faster than bubble sort.
- Avoids redundant sorting and memory by sorting in-place.
- Preserves comments and print statements.



This version is much faster, especially for large arrays.

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