python排序算法

1 def insert_sort(list):
2     for i in range(len(list)):
3         key = list[i]
4         for j in range(i-1,-1,-1):
5             if key < list[j]:
6                 list[j+1] = list[j]
7                 list[j] = key
8     return list
9 print insert_sort([5,4,3,2,1])

def bubble_sort(list):
    for i in range(len(list)):
        for j in range(i+1,len(list)):
            if list[i] > list[j]:
                list[j],list[i] = list[i],list[j]
　　return list

def part_sort(list,start,end):
    if start >= end-1:
        return
    flag = list[start]
    i = start
    for j in range(start+1,end):
        if list[j] < flag:
            i += 1
            if list[i] != list[j]:
                list[i],list[j] = list[j],list[i]
        else:
            pass
    list[i],list[start] = list[start],list[i]
    return i
def quick_sort(list,start,end):
    if start>=end-1:
        return
    flag_index = part_sort(list,start,end)
    quick_sort(list,start,flag_index)
    quick_sort(list,flag_index+1,end)
    return list

def fixDown(a,k,n): #自顶向下堆化，从k开始堆化  
    N=n-1  
    while 2*k<=N:  
        j=2*k  
        if j<N and a[j]<a[j+1]: #选出左右孩子节点中更大的那个  
            j+=1  
        if a[k]<a[j]:  
            a[k],a[j]=a[j],a[k]  
            k=j  
        else:  
            break  
  
def heapSort(l):  
    n=len(l)-1  
    for i in range(n//2,0,-1):  
        fixDown(l,i,len(l))  
    while n>1:  
        l[1],l[n]=l[n],l[1]  
        fixDown(l,1,n)  
        n-=1  
    return l[1:]  
  
l=[-1,26,5,77,1,61,11,59,15,48,19] #第一个元素不用，占位  
res=heapSort(l)  
print(res)