Updating

MohamedKiouaz · MohamedKiouaz · commit 8caa96ee10cd · 2017-08-06T10:16:55.000+01:00
If bubble sort does a full loop without any change to list, it returns.
diff --git a/pygorithm/sorting/bubble_sort.py b/pygorithm/sorting/bubble_sort.py
@@ -1,19 +1,24 @@
 # 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):
     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); Average case O(n * (n - 1) / 4); Worst case O(n ^ 2)'''
 
 # easily retrieve the source code of the sort function
 def get_code():
