Сортировка пузырьком от geeks-to-geeks

bubble_sorting_from_geeks_to_geeks.py

# Implementation of Bubble Sorting (from geeks-to-geeks):

def bubble_sort(arr):
    n = len(arr)
    for i in range(n-1):
        for j in range(0, 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]

bubble_sort(arr)

print ("Sorted array is:")
for i in range(len(arr)):
    print ("%d" %arr[i])