def ins_sort_rec(seq, i):
if i == 0: return
ins_sort_rec(seq, i - 1)
j = i
while j > 0 and seq[j - 1] > seq[j]:
seq[j - 1], seq[j] = seq[j], seq[j - 1]
j -= 1
seq = [3,-6,79,45,8,12,6,8]
ins_sort_rec(seq, len(seq)-1)
print(seq[5])
孩子有好多疑惑：
首先，为什么当i在前面减到0后，又会自动往上跳到1；其次，第六行不太理解。嘤嘤嘤