python下的几种排序实现

python排序

冒泡排序

def maopao(arr):
    for i in range(len(arr)):
        if i<len(arr)-1:
            if arr[i]>arr[i+1]:
                centent=arr[i]
                arr[i]=arr[i+1]
                arr[i+1]=centent
                maopao(arr)
                return arr
 
 def maopao1(arr):
    for i in range(len(arr)-1):
        for j in range(i+1,len(arr)):
            if arr[i]>arr[j]:
                arr[i],arr[j]=arr[j],arr[i]
    return arr

选择排序

def xuanze(arr):
    for i in range(0,len(arr)-1):
        min=i
        for j in range(i+1,len(arr)):
            if arr[j]<arr[min]:
                min=j
        arr[min],arr[i]=arr[i],arr[min]
    return arr
    

插入排序

def charu(arr):
    for i in range( len(arr)):
        for j in range(i,0,-1):
            if arr[j]<arr[j-1]:
                arr[j],arr[j-1]=arr[j-1],arr[j]
    return arr
    
def charu1(arr):
    for i in range(1,len(arr)):
        pre=i-1
        con=arr[i]
        while pre>=0 and con<arr[pre]:
            arr[pre+1]=arr[pre]
            pre-=1
        arr[pre+1]=con
    return arr

希尔排序

def xier(arr):
    leng=len(arr)
    val=leng//2
    while val>0:
        for i in range(val, len(arr)):
            pre = i - 1
            con = arr[i]
            while pre >= 0 and con < arr[pre]:
                arr[pre+1] = arr[pre]
                pre -= 1
            arr[pre+1] = con
        val=val//2
    return arr

快速排序

def kuaisu(arr):
    if len(arr)<2:
        return arr
    else:
        one=arr[0]
        bf=[]
        zj=[]
        lass=[]
        for i in range(len(arr)):
            if arr[i]<one:
                bf.append(arr[i])
            elif arr[i]==one:
                zj.append(arr[i])
            else:
                lass.append(arr[i])
        return kuaisu(bf)+zj+kuaisu(lass)

def kuaisu1(arr,start,end):
    if start>=end:
        return arr
    else:
        left=start
        right=end
        temp=arr[left]
        while left<right:
            while left<right and temp<=arr[right]:
                right-=1
            arr[left]=arr[right]
            while left<right and temp>=arr[left]:
                left+=1
            arr[right]=arr[left]
        arr[left]=temp
        kuaisu1(arr,start,left-1)
        kuaisu1(arr,left+1,end)

桶排序

def tong(arr):
    big=max(arr)
    con=[0]*(big+1)
    for i in arr:
        con[i]+=1
    arr1=[]
    for index in range(len(con)):
        if con[index]!=0:
            for j in range(con[index]):
                arr1.append(index)
    return arr1