python
institute
这个作者很懒,什么都没留下…
展开
-
算法导论学习笔记之四--堆排序
def left(i): return i*2 + 1 def right(i): return i*2 + 2 def parent(i): return (i-1) / 2 def max_heapify(A, i): l = left(i); r = right(i); if l A[i]: largest = l原创 2014-03-08 17:48:48 · 510 阅读 · 0 评论 -
算法导论学习笔记之五--同时得到最大和最小值复杂度3(n/2)
def get_min_max(l): if len(l) < 1: return None if len(l) == 1: return (l[0], l[0]) if l[0] < l[1]: min = l[0] max = l[1] else: min = l[1]原创 2014-03-09 01:13:05 · 827 阅读 · 0 评论 -
30 Python Language Features and Tricks You May Not Know About
original article: http://sahandsaba.com/thirty-python-language-features-and-tricks-you-may-not-know.html#unpacking 1.1 Unpacking >>> a, b, c = 1, 2, 3 >>> a, b, c (1, 2, 3) >>> a, b, c = [1,转载 2014-03-10 08:57:08 · 900 阅读 · 0 评论