（附代碼）動圖圖解 | 十大經(jīng)典排序算法Python版實(shí)現(xiàn)

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

def insertionSort(arr):    for i in range(len(arr)):        preIndex = i-1        current = arr[i]        while preIndex >= 0 and arr[preIndex] > current:            arr[preIndex+1] = arr[preIndex]            preIndex-=1        arr[preIndex+1] = current    return arr

def shellSort(arr):    import math    gap=1    while(gap < len(arr)/3):        gap = gap*3+1    while gap > 0:        for i in range(gap,len(arr)):            temp = arr[i]            j = i-gap            while j >=0 and arr[j] > temp:                arr[j+gap]=arr[j]                j-=gap            arr[j+gap] = temp        gap = math.floor(gap/3)    return arr}

def mergeSort(arr):    import math    if(len(arr)<2):        return arr    middle = math.floor(len(arr)/2)    left, right = arr[0:middle], arr[middle:]    return merge(mergeSort(left), mergeSort(right))
def merge(left,right):    result = []    while left and right:        if left[0] <= right[0]:            result.append(left.pop(0));        else:            result.append(right.pop(0));    while left:        result.append(left.pop(0));    while right:        result.append(right.pop(0));    return result

def quickSort(arr, left=None, right=None):    left = 0 if not isinstance(left,(int, float)) else left    right = len(arr)-1 if not isinstance(right,(int, float)) else right    if left < right:        partitionIndex = partition(arr, left, right)        quickSort(arr, left, partitionIndex-1)        quickSort(arr, partitionIndex+1, right)    return arr

def buildMaxHeap(arr):    import math    for i in range(math.floor(len(arr)/2),-1,-1):        heapify(arr,i)
def heapify(arr, i):    left = 2*i+1    right = 2*i+2    largest = i    if left < arrLen and arr[left] > arr[largest]:        largest = left    if right < arrLen and arr[right] > arr[largest]:        largest = right
    if largest != i:        swap(arr, i, largest)        heapify(arr, largest)

def bucket_sort(s):    """桶排序"""    min_num = min(s)    max_num = max(s)    # 桶的大小    bucket_range = (max_num-min_num) / len(s)    # 桶數(shù)組    count_list = [ [] for i in range(len(s) + 1)]    # 向桶數(shù)組填數(shù)    for i in s:        count_list[int((i-min_num)//bucket_range)].append(i)    s.clear()    # 回填，這里桶內(nèi)部排序直接調(diào)用了sorted    for i in count_list:        for j in sorted(i):            s.append(j)
if __name__ == __main__ :    a = [3.2,6,8,4,2,6,7,3]bucket_sort(a)print(a) # [2, 3, 3.2, 4, 6, 6, 7, 8]

def RadixSort(list):    i = 0                                    #初始為個位排序    n = 1                                     #最小的位數(shù)置為1（包含0）    max_num = max(list) #得到帶排序數(shù)組中最大數(shù)    while max_num > 10**n: #得到最大數(shù)是幾位數(shù)        n += 1    while i < n:        bucket = {} #用字典構(gòu)建桶        for x in range(10):            bucket.setdefault(x, []) #將每個桶置空        for x in list: #對每一位進(jìn)行排序            radix =int((x / (10**i)) % 10) #得到每位的基數(shù)            bucket[radix].append(x) #將對應(yīng)的數(shù)            組元素加入到相 #應(yīng)位基數(shù)的桶中        j = 0        for k in range(10):            if len(bucket[k]) != 0: #若桶不為空                for y in bucket[k]: #將該桶中每個元素                    list[j] = y #放回到數(shù)組中                    j += 1        i += 1return  list

END


雙一流大學(xué)研究生團(tuán)隊創(chuàng)建，專注于目標(biāo)檢測與深度學(xué)習(xí)，希望可以將分享變成一種習(xí)慣！
整理不易，點(diǎn)贊三連↓