An implementation of the Combsort algorithm

Combsort.py

def combsort(lst):
    gap = len(lst)
    shrink = 1.3
    swapped = True
    while not (gap == 1 and not swapped):
        gap = int(gap/shrink)
        if gap < 1:
            gap = 1
        i = 0
        swapped = False
        while not i + gap >= len(lst):
            if lst[i] > lst[i+gap]:
                lst[i], lst[i+gap] = lst[i+gap], lst[i]
                swapped = True
            i += 1