插入排序

def insertSort(nums)
    length=len(nums)
    if length==1:
        return nums
    for i in range(1,length):
        j=i-1
        key=nums[i]
        while j>=0 and nums[j]>key:
            nums[j+1]=nums[j]
            j-=1
        nums[j+1]=key
    return nums