Python 实现快速排序

def quickSort(data):
    if len(data)>=2:
        mid=data[len(data)//2]
        left,right=[],[]
        data.remove(mid)
        for num in data:
            if num>=mid:right.append(num)
            else: left.append(num)
        return quickSort(left)+[mid]+quickSort(right)
    else: return data