常見排序算法

常見排序算法

• 常見排序算法效率
• 冒泡排序
• 選擇排序
• 快速排序

def quick_sort(alist, start, end):
    mid = alist[start]
    low = start
    high = end

    if low >= high:
        return

    while low < high:
        while low < high and alist[high] >= mid:
            high -= 1
        alist[low] = alist[high]
        while low < high and alist[low] <= mid:
            low += 1
        alist[high] = alist[low]

    alist[low] = mid
    quick_sort(alist, start, low-1)
    # quick_sort(alist, 0, low-1) #會報錯
    quick_sort(alist, low+1, len(alist)-1)
    return alist

• 歸併排序
• 希爾排序
• 插入排序