24 lines
574 B
Python
24 lines
574 B
Python
|
#!/usr/bin/env python3
|
||
|
|
# Bubble sort in python
|
||
|
|
|
||
|
|
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]
|
||
|
|
|
||
|
|
arr = [64, 34, 25, 12, 22, 11, 90]
|
||
|
|
|
||
|
|
print ("Sorted array is:")
|
||
|
|
for i in range(len(arr)):
|
||
|
|
print ("%d" %arr[i]),
|