python算法实践1-直接插入排序

# 直接插入排序def InsertSort(mylist): size = len(mylist) i = 1 for i in range(1, size): if mylist[i] < mylist[i - 1]: tmp = mylist[i] j = i - 1 mylist[j + 1] = mylist[j] j = j - 1 while j >= 0 and mylist[j] > tmp: mylist[j + 1] = mylist[j] j = j - 1 mylist[j + 1] = tmp mylist0 = [12, 11, 13, 1, 2, 4, 3]InsertSort(mylist0)print(mylist0)