排序算法

1.冒泡排序

def Bubblesort(a):
    length=len(data)
    for i in range(length):
        for j in range(length-i-1):
            if a[j]>a[j+1]:
                a[j],a[j+1]=a[j+1],a[j]

2.直接插入排序

def Insertionsort(a):
    length=len(a)
    for i in range(1,length):
        tmp=a[i]
        for j in range(i-1,-1,-1):
            if a[j]>tmp:
                a[j+1]=a[j]
                a[j]=tmp

3.选择排序

def selectionsort(a):
    length=len(a)
    for i in range(length-1):
        for j in range(i+1,length):
            if a[i]>a[j]:
                a[i],a[j]=a[j],a[i]

4.快速排序

def quicksort(data,left,right):
        if left>right:
            return 
        tmp=data[left]
        i=left
        j=right
        while i<j:
            while data[j]>=tmp and i<j:
                j-=1
            while data[i]<=tmp and i<j:
                i+=1
            if i<j:
                data[i],data[j]=data[j],data[i]
        data[left]=data[i]
        data[i]=tmp
        quicksort(data,left,i-1)
        quicksort(data,i+1,right)

5.归并排序

def mergesort(a):
    length=len(a)
    if length<=1:return a
    mid=int(length/2)
    left=mergesort(a[:mid])
    right=mergesort(a[mid:])
    res=[]
    while left and right:
        res.append(left.pop(0) if left[0]<=right[0] else right.pop(0))
    res.extend(left if left else right)
    return res