def InsertionSort(nums):
for i in range(1, len(nums)):
cval = nums[i]
pos = i
while pos > 0 and nums[pos - 1] > cval:
nums[pos],nums[pos-1] = nums[pos - 1],nums[pos]
pos = pos - 1
return nums
插入排序
最新推荐文章于 2023-09-23 17:47:53 发布