⚡️ Speed up function sorter by 56,821%

Here's a faster version using Python's built-in `sort`, which is highly optimized (Timsort, O(n log n)), compared to the original bubble sort (O(n²)). This preserves the function signature and all behavior as required.



**Explanation**:  
- `arr.sort()` sorts the list in-place using Timsort, which is much faster than bubble sort for practical input sizes.
- No unnecessary loops or swaps; the function is both optimal in runtime and memory usage.  
- All existing side effects, such as printed output, are preserved.

Author: codeflash-ai[bot]

codeflash/bubble_sort.py

@@ -0,0 +1,6 @@
+def sorter(arr):
+    print("codeflash stdout: Sorting list")
+    # Using Python's built-in sort for much faster sorting
+    arr.sort()
+    print(f"result: {arr}")
+    return arr