mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Break if the collection is sorted

Browse Source
This commit is contained in:
Hossam Al-Dokkani 2018-06-23 17:01:06 +02:00
parent cb6c82cb0f
commit 9489e8512d
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sorts/bubble_sort.py
View File

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