从一个数组中找出前4个最大的数，用最优解。

#快速排序：最快的n*logNdef qiuckSort(list):    if len(list)<2:        return list    mid = list[0]    left = [i for i in list[1:] if i <= mid]    right = [i for i in list[1:] if i  mid]    finallyList = qiuckSort(left)+[mid] + qiuckSort(right)    return finallyListarray = [3, 0, 1, 832,23,45, 5, 5, 6,46, 9, 56, 897]print(qiuckSort(array)[-4:])