插入排序(python)

class InsertionSort:
‘’’
少量元素时较为高效
‘’’
def InsertionSort(self, nums): #升序
for j in range(1, len(nums)):
key = nums[j]
i = j - 1
while i >= 0 and nums[i] > key: #与j前的元素比较，满足条件的插到该元素之前
nums[i + 1] = nums[i]
i -= 1
nums[i + 1] = key
return nums
nums = [5,2,4,6,1,3,10,7,9,8,1]
x = InsertionSort()
print(x.InsertionSort(nums))