An implementation of the Cocktail Sort algorithm

Cocktail.py

def Cocktail(lst):
    swapped = True
    while swapped:
        swapped = False
        for i in range(0,len(lst)-2):
            if lst[i] > lst[i+1]:
                lst[i], lst[i+1] = lst[i+1], lst[i]
                swapped = True
        if not swapped:
            break
        for i in range(len(lst)-2,0,-1):
            if lst[i] > lst[i+1]:
                lst[i], lst[i+1] = lst[i+1], lst[i]
                swapped = True