13，希尔排序与快速排序的python实现

希尔排序

def shell_sort(alist):
    n = len(alist)
    gap = n // 2

    while gap > 0:
        for j in range(gap, n):
            i = j
            while i > 0:
                if alist[i] < alist[i-gap]:
                    alist[i], alist[i-gap] = alist[i-gap], alist[i]
                else:
                    break
        gap //= 2

快速排序

快速排序使用递归的方法，比较复杂。

def quick_sort(alist, first, last):
    if first >= last:
        return
    mid_value = alist[first]
    low = first
    high = last
    while low < high:
        while low < high and alist[high] >= mid_value:
            high -= 1
        alist[low] = alist[high]

        while low < high and alist[low] < mid_value:
            low += 1
        alist[high] = alist[low]

    alist[low] = mid_value

    quick_sort(alist, first, low-1)

    quick_sort(alist, low+1, last)