⚡️ Speed up function sorter by 56%

Certainly! The code you have provided uses a basic implementation of the Bubble Sort algorithm, which has a time complexity of \(O(n^2)\). We can make some small optimizations to enhance its performance, such as using a flag to detect if the list is already sorted.

However, for practical purposes and significant improvement, using Python's built-in sorting functionality, which is optimized with Timsort (a combination of merge sort and insertion sort), offers much better performance with a time complexity of \(O(n \log n)\).

Here is a more efficient version using Python's built-in `sorted()` function.



If you prefer to stick to a sorting algorithm and avoid Python's built-in, here's an optimized Bubble Sort with early exit if the list is already sorted.



This optimized Bubble Sort terminates early if the list becomes sorted before completing all passes, which can save unnecessary iterations.

Both provided versions improve the original's runtime performance significantly, especially the `sorted()` function approach.

bubble_sort.py

@@ -1,8 +1,11 @@
 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
+    n = len(arr)
+    for i in range(n):
+        swapped = False
+        for j in range(1, n - i):
+            if arr[j - 1] > arr[j]:
+                arr[j - 1], arr[j] = arr[j], arr[j - 1]
+                swapped = True
+        if not swapped:
+            break
     return arr