bubble-sort.py

defbubbleSort(arr):
n=len(arr)
# optimize code, so if the array is already sorted, it doesn't need
# to go through the entire process
swapped=False
# Traverse through all array elements
foriinrange(n-1):
# range(n) also work but outer loop will
# repeat one time more than needed.
# Last i elements are already in place
forjinrange(0, n-i-1):

# traverse the array from 0 to n-i-1
# Swap if the element found is greater
# than the next element
ifarr[j] >arr[j+1]:
swapped=True
arr[j], arr[j+1] =arr[j+1], arr[j]

ifnotswapped:
# if we haven't needed to make a single swap, we
# can just exit the main loop.
return


# Driver code to test above
arr= [64, 34, 25, 12, 22, 11, 90]

bubbleSort(arr)

print("Sorted array is:")
foriinrange(len(arr)):
print("% d"%arr[i], end=" ")