def bubble_sort(li_to_sort):
# Looping from size of array from last index[-1] to index [0]
for n in range(len(li_to_sort)-1, 0, -1):
for i in range(n):
if li_to_sort[i] > li_to_sort[i + 1]:
# swapping data if the element is less than next element in the array
li_to_sort[i], li_to_sort[i + 1] = li_to_sort[i + 1], li_to_sort[i]
li = [39, 12, 18, 85, 72, 10, 2, 18]
print("Unsorted list: ", li)
bubble_sort(li)
print("Sorted List: ", li)# Python3 Optimized implementation
# of Bubble sort
# An optimized version of Bubble Sort
def bubbleSort(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n):
swapped = False
# 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]
swapped = True
# IF no two elements were swapped
# by inner loop, then break
if swapped == False:
break
# Driver code to test above
arr = [64, 34, 25, 12, 22, 11, 90]
bubbleSort(arr)
print ("Sorted array :")
for i in range(len(arr)):
print ("%d" %arr[i],end=" ")
# This code is contributed by Shreyanshi Arunfor i in range(x - 1):
for j in range(x - 1 - i):
if s[j]>s[j + 1]:
s[j],s[j + 1] = s[j + 1],s[j]
print(*s, sep=' ')