Example 1: bubble sort python
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
Example 2: python bubble sort
def bubbleSort(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n-1):
# range(n) also work but outer loop will repeat one time more than needed.
# 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)
Example 3: bubble sort in python
def bubble_sort(arr):
x=-1
n=len(arr)#length of array 6
for i in range (0,n):
for j in range(1,n-i):
if arr[j-1]>arr[j]:
arr[j-1],arr[j]=arr[j],arr[j-1]
if (n-i)<=1:
break
return arr
if "__main__"==__name__:
arr=[7,1,2,6,9,3,8,4]
result=bubble_sort(arr)
print(result)
Example 4: bubble sort python
def bubble_sort(arr):
def swap(i, j):
arr[i], arr[j] = arr[j], arr[i]
n = len(arr)
swapped = True
x = -1
while swapped:
swapped = False
x = x + 1
for i in range(1, n-x):
if arr[i - 1] > arr[i]:
swap(i - 1, i)
swapped = True
return arr
Example 5: bubble sort technique in python
def bubbleSort(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n-1):
# range(n) also work but outer loop will repeat one time more than needed.
# 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 = [10, 51, 2, 18, 4, 31, 13, 5, 23, 64, 29]
bubbleSort(arr)
print ("Sorted array is:")
for i in range(len(arr)):
print ("%d" %arr[i]),
Example 6: bubble sort in python
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