上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 118 下一页
摘要: import random def merge(li,low,mid,hight): i = low j = mid + 1 tmp = [] while i<=mid and j <= hight: if li[i] < li[j]: tmp.append(li[i]) i += 1 else: 阅读全文
posted @ 2021-11-28 15:09 NAVYSUMMER 阅读(54) 评论(0) 推荐(0)
摘要: import random def generate_big_root_heap(li,low,hight): i = low j = 2 * i + 1 tmp = li[i] while j <= hight: if j + 1 <= hight and li[j+1] > li[j]: j = 阅读全文
posted @ 2021-11-20 13:38 NAVYSUMMER 阅读(62) 评论(0) 推荐(0)
摘要: import random def generate_big_root_heap(li,low,hight): i = low j = 2 * i + 1 tmp = li[i] while j <= hight: if j + 1 <= hight and li[j+1] > li[j]: j = 阅读全文
posted @ 2021-11-20 12:02 NAVYSUMMER 阅读(61) 评论(0) 推荐(0)
摘要: 日志 日志是跟踪软件运行时所发生的事件的一种方法。软件开发者在代码中调用日志函数,表明发生了特定的事件。事件由描述性消息描述,该描述性消息可以可选地包含可变数据(即,对于事件的每次出现都潜在地不同的数据)。事件还具有开发者归因于事件的重要性;重要性也可以称为级别或严重性。 logging提供了一组便 阅读全文
posted @ 2021-11-18 19:35 NAVYSUMMER 阅读(1092) 评论(0) 推荐(0)
摘要: 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 阅读(53) 评论(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 阅读(26) 评论(0) 推荐(0)
摘要: 版本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)
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 118 下一页
交流群 编程书籍