【发布时间】:2018-10-24 17:08:52
【问题描述】:
大家好,我正在尝试递归地实现插入,但我的列表没有得到排序。欢迎任何帮助或改进。
sequence = [1,4,3,5,7,6,8,2]
def insertion(seq):
for i in range(len(seq)):
key = seq[i]
j = i
print(seq)
while j > 0 and seq[j-1] > key:
j = j - 1
seq[j] == key
insertion(sequence)
【问题讨论】:
标签: python recursion insertion-sort