排序

1、冒泡排序

def bubbleSort(list):
    for i in range(len(list)):
        for j in range(len(list)-1,i,-1):
            if list[j-1]>list[j]:
                temp=list[j-1]
                list[j-1]=list[j]
                list[j]=temp
                
    return list

2、归并排序

def Merge(list,templist,left,middle,right):
    leftEnd=middle-1
    rightStart=middle
    tempIndex=left
    tempLen=right-left+1
    
    while left<=leftEnd and rightStart<=right:
        if list[left]<list[rightStart]:
            templist[tempIndex]=list[left]
            tempIndex+=1
            left+=1
        else:
            templist[tempIndex]=list[rightStart]
            tempIndex+=1
            rightStart+=1
            
    while left<=leftEnd:
        templist[tempIndex]=list[left]
        tempIndex+=1
        left+=1
        
    while rightStart<=right:
        templist[tempIndex]=list[rightStart]
        tempIndex+=1
        rightStart+=1

    for i in range(tempLen):
        list[right]=templist[right]
        right-=1

def MergeSort(list,templist,left,right):
    if left<right:
        middle=(left+right)//2
        MergeSort(list,templist,left,middle)
        MergeSort(list,templist,middle+1,right)
        Merge(list,templist,left,middle+1,right)
    return list

3、快速排序

def Division(list,left,right):
    base=list[left]
    while left<right:
        while left<right and list[right]>=base:
            right-=1
        list[left]=list[right]
        
        while left<right and list[left]<=base:
            left+=1
        list[right]=list[left]
        
    list[left]=base
    return left
   

def QuickSort(list,left,right):
    if left<right:
        i=Division(list,left,right)
        QuickSort(list,left,i-1)
        QuickSort(list,i+1,right)

4、堆排序

def HeapAdjust(list,parent,length):
    temp=list[parent]
    child=2*parent+1
    while child<length:
        if child+1<length and list[child]<list[child+1]:
            child=child+1
        if temp>=list[child]:
            break
        list[parent]=list[child]
        parent=child
        child=2*parent+1
    list[parent]=temp
    
def HeapSort(list):
    for i in range(len(list)//2-1,-1,-1):
        HeapAdjust(list,i,len(list))
    for i in range(len(list)-1,0,-1):
        temp=list[0]
        list[0]=list[i]
        list[i]=temp
        HeapAdjust(list,0,i)
    return list