手写冒泡和插入排序 python3

IDE验证： def insertsort(ary): n = len(ary) for i in range(1,n): j = i - 1 while j >= 0: if ary[j] > ary[j+1]: ary[j], ary[j+1] = ary[j+1], ary[j]

>>阅读原文<<