#HACTOBERFEST UDATE CODE

Programs/bubble_sort.py

@@ -1,26 +1,20 @@
-# Python program for implementation of Bubble Sort 
-
-def bubbleSort(arr): 
-    n = len(arr) 
-
-    # Traverse through all array elements 
-    for i in range(n-1): 
-    # range(n) also work but more than needed. 
-
-        # Last i elements are already in place 
-        for j in range(0, n-i-1): 
-
-            # traverse from 0 to n-i-1 
-            # Swap found is greater 
-            # than the next element 
-            if arr[j] > arr[j+1] : 
-                arr[j], arr[j+1] = arr[j+1], arr[j] 
-
-# Driver code to test above 
-arr = [64, 34, 25, 12, 2, 1, 90] 
-
-bubbleSort(arr) 
-
-print ("Sorted array is:") 
-for i in range(len(arr)): 
-    print ("%d" %arr[i]),
+def bubble_sort(arr):
+    n = len(arr)
+
+    # Traverse through all array elements
+    for i in range(n - 1):
+        # Last i elements are already in place
+        for j in range(0, n - i - 1):
+            # Traverse from 0 to n-i-1
+            # Swap if the element found is greater
+            # than the next element
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+
+# Driver code to test above
+arr = [64, 34, 25, 12, 2, 1, 90]
+bubble_sort(arr)
+
+print("Sorted array is:")
+for element in arr:
+    print(element)