Merge pull request #1 from MohamedKiouaz/master

Update to Bubble Sort

Author: OmkarPathak

pygorithm/sorting/bubble_sort.py

@@ -1,7 +1,8 @@
 # Author: OMKAR PATHAK
+# Contributors: Mohamed Kiouaz
 # Created On: 31st July 2017
 
-# Best O(n^2); Average O(n^2); Worst O(n^2)
+# Best O(n); Average O(n*(n-1)/4); Worst O(n^2)
 
 # Bubble Sorting algorithm
 def sort(List):
@@ -11,11 +12,31 @@ def sort(List):
                 List[j], List[j - 1] = List[j - 1], List[j]
     return List
 
+# Improved Bubble Sorting algorithm
+def improved_sort(List):
+    for i in range(len(List)):
+        stop = True
+        for j in range(len(List) - 1, i, -1):
+            if List[j] < List[j - 1]:
+                stop = False
+                List[j], List[j - 1] = List[j - 1], List[j]
+        if(stop == True):
+            return List
+    return List
+
 # time complexities
 def time_complexities():
-    return '''Best Case: O(n ^ 2), Average Case: O(n ^ 2), Worst Case: O(n ^ 2)'''
+    return '''Best Case: O(n ^ 2), Average Case: O(n ^ 2), Worst Case: O(n ^ 2)
+              For Improved Bubble Sort:
+              Best Case: O(n); Average Case: O(n * (n - 1) / 4); Worst Case: O(n ^ 2)
+           '''
 
 # easily retrieve the source code of the sort function
 def get_code():
     import inspect
     return inspect.getsource(sort)
+
+# easily retrieve the source code of the sort function
+def get_improved_code():
+    import inspect
+    return inspect.getsource(improved_sort)