python快速排序

'''
Created on 2013-7-21

@author: windowsp
'''
import sys
import random
MAX_NUM = 1000000

def getRandom():
    return random.randrange(0, MAX_NUM)

def getRandomList(sortNum):
    arr=[]
    for i in range(sortNum):
        arr.append(getRandom())
    return arr


def myquicksort(array,lowa,higha):
    low=lowa
    high=higha
    if(low>=high):
        return
    temp=array[low]#第一个位置为枢轴的位子 
    pivotket=array[low]
    while(low<high):
        while(array[high]>=pivotket and low<high):
            high-=1       
        array[low]=array[high]
        while(array[low]<=pivotket and low < high):
            low+=1
        array[high]=array[low]
    array[low]=temp
    
    myquicksort(array, lowa, low-1)
    myquicksort(array,low+1,higha)      
    
if __name__ == '__main__':
    sslist = getRandomList(100000)
    print(sslist)
    myquicksort(sslist, 0, len(sslist)-1)
    print("the last is {}".format(sslist))