快速排序

def QSort(array):                #快速排序（从小到大）：分而治之，divide and conquer, D&C
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]
        greater = [i for i in array[1:] if i > pivot]
        return QSort(less) + [pivot] + QSort(greater)     #递归思想
    
if __name__ == '__main__':
    array = [10, 5, 2, 3]
    print(QSort(array))@haijee