def insert_sort(seq):
    for i in range(len(seq)):
        j=i-1
        value=seq[i]
        while(j>=0and seq[j]>value):
            seq[j+1]=seq[j]
            j=j-1
        seq[j+1]=value
    return seq
def quick_sort(seq):
    if(len(seq)<=1):return seq
    #把seq[0]作为中值
    left=[y for y in seq[1:] if y < seq[0]]
    right=[y for y in seq[1:] if y >= seq[0]]
    return quick_sort(left)+[seq[0]]+quick_sort(right)
 
if __name__ == "__main__": 
    seq=[5,3,6,7,1,9,3]
    print insert_sort(seq)
    print quick_sort(seq)