A slightly refined bubble sort function.

bubsort.py

def bubsort(a):
    i = len(a)
    counter = 0
    while i > 0:
        for j in range(len(a)):
            h = j+1
            if h < len(a):
                if a[j] > a[h]:
                    temp = a[h]
                    a[h] = a[j]
                    a[j] = temp
                    counter += 1
                    
        if counter == 0:
            break
        else:
            i -= 1
            counter = 0
            print a           

bubsort([1,0,5,9,8,4,7,3,2,6])