# Author:Liusw
# 插入排序
def insertionSort(nums,order):
for i in range(1,len(nums)):
key = nums[i]
j = i -1
if order == "desc":
while j >= 0 and nums[j] < key :
nums[j+1] = nums[j] # 小于key 的值右移
j =j-1
# while结束找到大于key值的下标
nums[j+1] = key
else:
while j >= 0 and nums[j] > key:
nums[j + 1] = nums[j] # 大于key 的值右移
j = j - 1
# while结束找到大于key值的下标
nums[j + 1] = key
return nums
if __name__ == '__main__':
nums = [2,4,44,12,34,5,34,3,5,23,7]
# print(range(1,len(nums)))
print(insertionSort(nums,"desc"))