Created
May 14, 2019 21:38
-
-
Save erick2014/fceecb6e9838aa3d510047729665cab3 to your computer and use it in GitHub Desktop.
Bubble Sort algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
sorted = True | |
numbers = [3, 5, 4, 2] | |
numbersLength = len(numbers) | |
while sorted: | |
sorted = False | |
for number in range(len(numbers)): | |
nextNumber = number + 1 | |
if nextNumber == numbersLength: | |
break | |
if numbers[number] > numbers[nextNumber]: | |
currentNumberValue = numbers[number] | |
numbers[number] = numbers[nextNumber] | |
numbers[nextNumber] = currentNumberValue | |
sorted = True | |
if not sorted: | |
break | |
print(numbers) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment