Bad algorithms #1: bad sort!

badsort.py

import random

def badsort(l):
    done = False
    loops = 0
    while not done:
        loops += 1
        random.shuffle(l)
        done = True
        for i in range(len(l)-1):
            if l[i] > l[i+1]:
                done = False
                break
    return l, loops

print(badsort([1,2,5,8,122,2,3,11,4,6]))