算法
文章平均质量分 55
mihawk20102
这个作者很懒,什么都没留下…
展开
-
算法概论 -- Chapter 0 Prologue
Fibonacci numbers: Introduction : F(n) = F(n-1) + F(n-2) , for n >= 2, and F(0) = 0, F(1) = 1 One approximation of F(n) is roughly , now I'm gonna prove it first. ...原创 2014-10-15 12:02:21 · 250 阅读 · 0 评论 -
【转载】The diameter of the tree
http://www.quora.com/How-does-following-algorithm-for-finding-longest-path-in-tree-work 留作自己查看原创 2014-10-22 21:39:13 · 130 阅读 · 0 评论