pyhon快速排序

def quickSort(nums) :    if len(nums) <= 1 :        return nums    return quickSort([x for x in nums  if x < nums[0]]) + \           [x for x in nums if x == nums[0]] + \           quickSort([x for x in nums if x >nums[0]])if __name__ == '__main__':    numbers = [1,0,2,5,12,6,5,0,1,9]    m = quickSort(numbers)    print m