def quick_sort(array):
    if len(array) < 2:
        return array
    else:
        first, last = 0, len(array)-1
        if first < last:
            left_list = [x for x in array if x < array[first]]
            right_list = [x for x in array if x > array[first]]
            
 
return quick_sort(left_list) + [array[first]] + quick_sort(right_list)

array_0 = [12, 23, 54, 32, 11, 76, 5, 73]
quick_sort(array_0)
>>> [5, 11, 12, 23, 32, 54, 73, 76]

python極簡代碼實現快速排序