Merge pull request keon#89 from ss18/sort/bubble_sort

Bubble sort

Author: ankit167

README.md

@@ -129,6 +129,9 @@ Minimal and clean example implementations of data structures and algorithms in P
 - [set](set)
     - [randomized_set](set/randomized_set.py)
 - [sort](sort)
+    - [bubble_sort](sort/bubble_sort.py)
+    - [counting_sort](sort/counting_sort.py)
+    - [heap_sort](sort/heap_sort.py)
     - [insertion_sort](sort/insertion_sort.py)
     - [meeting_rooms](sort/meeting_rooms.py)
     - [merge_sort](sort/merge_sort.py)
@@ -137,7 +140,6 @@ Minimal and clean example implementations of data structures and algorithms in P
     - [sort_colors](sort/sort_colors.py)
     - [topsort](sort/topsort.py)
     - [wiggle_sort](sort/wiggle_sort.py)
-    - [counting_sort](sort/counting_sort.py)
 - [stack](stack)
     - [longest_abs_path](stack/longest_abs_path.py)
     - [simplify_path](stack/simplify_path.py)

sort/bubble_sort.py

@@ -0,0 +1,28 @@
+"""
+
+https://en.wikipedia.org/wiki/Bubble_sort
+
+Complexity: O(N^2)
+
+"""
+
+
+def bubble_sort(arr):
+
+    def swap(i, j):
+        arr[i], arr[j] = arr[j], arr[i]
+
+    n = len(arr)
+    swapped = True
+    while swapped:
+        swapped = False
+        for i in range(1, n):
+            if arr[i - 1] > arr[i]:
+                swap(i - 1, i)
+                swapped = True
+
+array = [1, 5, 65, 23, 57, 1232, -1, -5, -2, 242, 100,
+         4, 423, 2, 564, 9, 0, 10, 43, 64, 32, 1, 999]
+print(array)
+bubble_sort(array)
+print(array)