Bubble Sort

Author: Shikha-code36

README.md

@@ -22,4 +22,6 @@ Data Structures and Algorithms Patterns implemented in Python.
 - [x] [Searching Alogorithms](Searching-Algo)
     - [x] [Linear Search](Searching-Algo/linearsearch.py)
     - [x] [Binary Search](Searching-Algo/binarysearch.py)
+- [x] [Sorting Alogorithms](Sorting-Algo)
+    - [x] [Bubble Sort](Sorting-Algo/bubblesort.py)
 

Sorting-Algo/bubblesort.py

@@ -0,0 +1,64 @@
+'''
+                                    Bubble Sort
+Bubble sort is a sorting algorithm that compares two adjacent elements and swaps them until they are not in the intended order.
+'''
+
+def bubbleSort(array):
+    
+  # loop to access each array element
+  for i in range(len(array)):
+
+    # loop to compare array elements
+    for j in range(0, len(array) - i - 1):
+
+      # compare two adjacent elements
+      # change > to < to sort in descending order
+      if array[j] > array[j + 1]:
+
+        # swapping elements if elements
+        # are not in the intended order
+        temp = array[j]
+        array[j] = array[j+1]
+        array[j+1] = temp
+
+
+list = [-2, 45, 0, 11, -9]
+
+bubbleSort(list)
+print(list) #[-9, -2, 0, 11, 45]
+
+# Optimized
+
+def bubbleSort(array):
+    
+  # loop through each element of array
+  for i in range(len(array)):
+        
+    # keep track of swapping
+    swapped = False
+    
+    # loop to compare array elements
+    for j in range(0, len(array) - i - 1):
+
+      # compare two adjacent elements
+      # change > to < to sort in descending order
+      if array[j] > array[j + 1]:
+
+        # swapping occurs if elements
+        # are not in the intended order
+        temp = array[j]
+        array[j] = array[j+1]
+        array[j+1] = temp
+
+        swapped = True
+          
+    # no swapping means the array is already sorted
+    # so no need for further comparison
+    if not swapped:
+      break
+
+list = [-2, 45, 0, 11, -9]
+
+bubbleSort(list)
+print(list) #[-9, -2, 0, 11, 45]
+