快速排序 Python实现

##nums is the list including numbers##
def Partition(nums, left, right):
    privot = nums[left]
    while left<right:
        while left<right and nums[right]>=privot:
            right -= 1
        nums[left] = nums[right]
        while left<right and nums[left]<=privot:
            left += 1
        nums[right] = nums[left]
    nums[left] = privot
    return left

def QuickSort(nums, left, right):
    if left<right:
        privotpos = Partition(nums, left, right)
        QuickSort(nums, left, privotpos-1)
        QuickSort(nums, privotpos+1, right)
    return nums
    
if __name__ == '__main__':
    nums = [int(i) for i in raw_input().split()]
    nums = QuickSort(nums, 0, len(nums)-1)
    print nums