삽입 정렬 파이썬 질문있습니다.

def MyInsertionSort(name):
    for i in range(1,len(name)):
        key=i
        for k in range(key,0,-1):
            if name[key]<name[k-1]:
                name[key],name[k-1]=name[k-1],name[key]
                key-=1
            else:
                break
    return print(name)