def bubsort(l):
    #
    def fmin(ll):
        minv = ll[0]
        ind =0
        lr=len(ll)
        for x in range(1,lr):
            if ll[x]<minv:
                ind =x
                minv=ll[x]
        return ind
    #
    lc= l.copy()
    res= []
    while len(lc)>0:
        ind=fmin(lc)
        res.append(lc.pop(ind))
    return res