python 排序

python 写的排序，实现起来还是比较简单

#快速排序
def  qsort(L):
    if len(L)>1:
        return qsort([i for i in L[1:] if i<L[0]]) + L[0:1] + qsort([ge for ge in L[1:] if ge>=L[0]])
    else:
        return L
#插入排序
def crsort(list):
    L=list
    for i in range(len(L)-1):
        for x in range(i+1,len(L)):
            if L[i]>L[x]:
                L[i],L[x]=L[x],L[i]
    return L
#冒泡排序
def mpsort(list):
    L=list
    for i in range(len(L)-1,0,-1):
        for j in range(i):
            if L[i]<L[j]:
                L[i],L[j]=L[j],L[i]
    return L