bubble sort in python

main.py
def bubble_sort(arr):
    n = len(arr)
    # Traverse through all array elements
    for i in range(n):
        # Last i elements are already sorted
        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]
  
bubble_sort(arr)
  
print ("Sorted array is:")
for i in range(len(arr)):
    print ("%d" %arr[i]), 
547 chars
20 lines

main.py
Sorted array is:
11
12
22
25
34
64
90
38 chars
9 lines