摘要：
版本1 def select_sort(li): li_new = [] for i in range(len(li)): min_val = min(li) li_new.append(min_val) li.remove(min_val) return li_new li = [1,5,3,7, 阅读全文
posted @ 2021-10-01 21:51
NAVYSUMMER
阅读(24)
评论(0)
推荐(0)
摘要：
版本1： def bubble_sort(li): length = len(li) for i in range(length): for j in range(length): if li[i] > li[j]: li[i],li[j] = li[j],li[i] li = [1,5,3,7,9 阅读全文
posted @ 2021-10-01 21:25
NAVYSUMMER
阅读(47)
评论(0)
推荐(0)
摘要：
二分查找，需要先排序 def binary_search(li,val): left = 0 right = len(li)-1 while left <= right: mid = (left+right) // 2 if li[mid] == val: return mid elif li[mi 阅读全文
posted @ 2021-10-01 21:06
NAVYSUMMER
阅读(28)
评论(0)
推荐(0)
摘要：
def line_search(li,val): for ix,v in enumerate(li): if v == val: return ix return None li = [1,5,3,7] ix = line_search(li,3) print(ix) 阅读全文
posted @ 2021-10-01 20:46
NAVYSUMMER
阅读(23)
评论(0)
推荐(0)
摘要：
def hanoi(n,a,b,c): if n > 0: hanoi(n-1,a,c,b) print("moving from %s to %s"%(a,c)) hanoi(n-1,b,a,c) hanoi(3,"A","B","C") 阅读全文
posted @ 2021-10-01 20:36
NAVYSUMMER
阅读(94)
评论(0)
推荐(0)
浙公网安备 33010602011771号