摘要：
def partation(li,left,right): tmp = li[left] while left < right: while left < right and li[right] >= tmp: # 右边找比tmp小的数 right -= 1 li[left] = li[right] 阅读全文
posted @ 2021-11-13 11:27
NAVYSUMMER
阅读(60)
评论(0)
推荐(0)
摘要：
def insert_sort(li): for i in range(1,len(li)): j = i - 1 tmp = li[i] while j >= 0 and tmp < li[j]: li[j+1] = li[j] j -= 1 li[j+1] = tmp return li def 阅读全文
posted @ 2021-11-13 10:16
NAVYSUMMER
阅读(31)
评论(0)
推荐(0)
浙公网安备 33010602011771号