笔试题-python实现快排

#coding=utf-8
import sys
import math

def partion(nums,left,right): #partion
    key = nums[left];
    low = left;
    high = right;
    while low < high:
        while(low < high) and (nums[high] >=key):
            high = high -1;
        nums[low] = nums[high];
        while(low < high) and (nums[high] <=key):
            low = low +1;
        nums[high] = nums[low];
        nums[low] = key;
    return low

def quicksort(nums,left,right):#quicksort
    if left<right:
        p = partion(nums,left,right);
        quicksort(nums,left,p-1);
        quicksort(nums,p+1,right);#递归操作
    return nums;

if __name__ == "__main__":
    a= raw_input();
    nums=[];
    for i in a.split(' '):
        nums.append(int(i));
    right = len(nums)-1;
    left = 0;
    ans = quicksort(nums,left,right);

    print ans;