Python
古巴与八股
未来的相视一笑 只因曾经的全然相爱
展开
-
二分查找 python版
def erfen(tmp, t, l, r): if(l < r): m = (l+r)/2 if(tmp[m] >= t): return erfen(tmp, t, l, m) else: return erfen(tmp, t, m+1, r) elif(l == r):原创 2017-09-01 15:43:10 · 175 阅读 · 0 评论 -
快速排序 python版
def qsort(data, l, r): if l < r: tmp = data[l] lt = l rt = r while lt < rt: while data[rt] >= tmp and rt > lt: rt -= 1 data[原创 2017-09-01 15:22:50 · 172 阅读 · 0 评论 -
归并排序 python版
def guibing(data, l, r): if(l < r): m = (l+r)/2 guibing(data, l, m) guibing(data, m+1, r) tmp = [x for x in data] lt = m rt = r while(lt >=原创 2017-09-01 09:46:06 · 218 阅读 · 0 评论