算法：Rate of Growth
摘要：
Rate of growth describes how an algorithm’s complexity changes as the input size grows. This is commonly represented using Big-O notation. Big-O notation uses a capital O (“order”) and a formula that expresses the complexity of the algorithm. The formula may have a variable, n, which represents the 阅读全文
posted @ 2013-11-28 17:30 幸福框架 阅读(2042) 评论(0) 推荐(0) 编辑
