Merge pull request TheAlgorithms#321 from aldokkani/master

Break if the collection is sorted

Author: harshildarji

sorts/bubble_sort.py

@@ -32,10 +32,12 @@ def bubble_sort(collection):
     """
     length = len(collection)
     for i in range(length):
+        swapped = False
         for j in range(length-1):
             if collection[j] > collection[j+1]:
+                swapped = True
                 collection[j], collection[j+1] = collection[j+1], collection[j]
-
+        if not swapped: break  # Stop iteration if the collection is sorted.
     return collection