def bubbleSort(lis):
length = len(lis)
for i in range(length):
for j in range(length - i):
a = lis[j]
if a != lis[-1]:
b = lis[j + 1]
if a > b:
lis[j] = b
lis[j + 1] = a
return lis"""
Bubble sort sorts a list by repeatedly
swapping adjacent out-of-order values.
The process continues until the list
becomes sorted.
"""
def bubble_sort(array):
isSorted = False
passes = 0
length = len(array)
while not isSorted:
isSorted = True
# perform a pass through the array
# excluding already sorted positions
for i in range(length-1-passes):
if array[i] > array[i+1]:
swap(i, i+1, array)
# array is not sorted yet
isSorted = False
passes += 1
return array
def swap(i, j, array):
# Swap values at indexes i and j
array[i], array[j] = array[j], array[i]
arr = [1, 9, 3, 2]
print(bubble_sort(arr)) # [1, 2, 3, 9]def bubble(st):
for i in range(len(st),1,-1):
for j in range(0,i-1):
if st[j]>st[j+1]:
st[j],st[j+1]=st[j+1],st[j]
else:
pass
print(st)
bubble([64, 34, 25, 12, 22, 11, 90] )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)def bubbleSort(lis):
length = len(lis)
for i in range(length):
for j in range(length - i):
a = lis[j]
if a != lis[-1]:
b = lis[j + 1]
if a > b:
lis[j] = b
lis[j + 1] = a
return lis
s= [1,2,3,4,5,6,7,8,9,10]
for i in range(len(s)-1):
for j in range(len(s)-1-i):
if s[j]>s[j+1]:
s[j],s[j+1] = s[j+1],s[j]
print(s)