An implementation of the Gnomesort algorithm

Gnomesort.py

def gnomesort(lst):
    pos = 1
    while pos < len(lst):
        if lst[pos] >= lst[pos-1]:
            pos += 1
        else:
            lst[pos], lst[pos-1] = lst[pos-1], lst[pos]
            if pos > 1:
                pos -= 1