Created
June 5, 2018 09:07
-
-
Save shameemreza/9b4cb394adfe8516e4774523b88a766b to your computer and use it in GitHub Desktop.
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
# Python program for implementation of Bubble Sort | |
def bubbleSort(arr): | |
n = len(arr) | |
# Traverse through all array elements | |
for i in range(n): | |
# Last i elements are already in place | |
for j in range(0, n-i-1): | |
# traverse the array from 0 to n-i-1 | |
# Swap if the element found is greater | |
# than the next element | |
if arr[j] > arr[j+1] : | |
arr[j], arr[j+1] = arr[j+1], arr[j] | |
# Driver code to test above | |
arr = [64, 34, 25, 12, 22, 11, 90] | |
bubbleSort(arr) | |
print ("Sorted array is:") | |
for i in range(len(arr)): | |
print ("%d" %arr[i]), |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment