Algorithm Analysis(Chapter 2 of The Algorithm Design Manual)
摘要：
The formal definitions associated with the Big Oh notation are as follows: • f(n) = O(g(n)) means c · g(n) is an upper bound on f(n). Thus there existssome constant c such that f(n) is alw... 阅读全文
posted @ 2010-09-04 20:51 Ray Z 阅读(253) 评论(0) 推荐(0) 编辑
