⚡️ Speed up function sorter by 764,385%

Certainly! The original program uses a bubble sort algorithm, which is inefficient for large datasets. To improve the runtime, we can use Python's built-in `sort` method, which implements Timsort, an adaptive sorting algorithm that provides better performance. Here's the rewritten program.



This change will significantly reduce the running time of the sorting operation, especially for larger arrays.

bubble_sort.py

@@ -1,8 +1,3 @@
 def sorter(arr):
-    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()
     return arr