python 代码

n = int(raw_input())
nums = map(int, raw_input().split())

def quick(nums, n):

    def partition(nums, l, r):
        p = nums[l]
        while l<r:
            while l<r and p<=nums[r]:
                r-=1
            nums[l] = nums[r]
            while l<r and p>=nums[l]:
                l+=1
            nums[r] = nums[l]
        nums[l] = p
        return l


    def quickHelper(nums, l, r):
        if l<r:
            p = partition(nums, l, r)
            quickHelper(nums, l, p)
            quickHelper(nums, p+1, r)
    quickHelper(nums, 0, n-1)
quick(nums, n)
print ' '.join(map(str, nums))