六.快速排序(python)

class QuickSort:
    def __init__(self):
        pass

    def quick_sort(self,array):
        """快速排序"""
        if len(array) < 2:
            return array
        else:
            first = array[0]
            min = [i for i in array[1:] if i <= first]
            max = [i for i in array[1:] if i > first]
            print(min)
            print([first])
            print(max)
            print("-"*10)
            return self.quick_sort(min) + [first] + self.quick_sort(max)

if __name__ == "__main__":
    quick = QuickSort()
    array = [10, 100, 2, 5, 16, 34,12,2,40,10000,44,1,6]
    a = quick.quick_sort(array)
    print(a)

采用分治思想,分组排序,数据分到最简单的时候,使用简单的算法进行排序;