算法-目录
参考链接: Python 插入排序
class Solution:
def insertionSort(self,arr):
for i in range(len(arr)):
key=arr[i]
j=i-1
while j>=0 and arr[j]>key:
arr[j+1]=arr[j]
j-=1
arr[j+1]=key
return arr
s=Solution()
ans=list(map(int,input("请输入一行数字:").strip().split()))
print('输出为:'," ".join(map(str,s.insertionSort(ans))))