bubblesort.py

bubblesort.py

@@ -0,0 +1,21 @@
+def bubbleSort(arr):
+    n = len(arr)
+    # Traverse through all array elements
+    for i in range(n - 1):
+        # Last i elements are already in place
+        swapped = False
+        # Traverse the array from 0 to n-i-1
+        # Swap if the element found is greater
+        # than the next element
+        for j in range(0, n - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+                swapped = True
+        # If no two elements were swapped by inner loop, then break
+        if not swapped:
+            break
+
+# Example usage
+arr = [64, 34, 25, 12, 22, 11, 90]
+bubbleSort(arr)
+print("Sorted array:", arr)