2018年11月26日
复杂度定义 The Definition of Complexity
摘要： The upper bound Big-O: Definition: f(n) is in O(g(n)) if there are constants c0 and N0 such that f(n) < c0*g(n) for all n>N0. We are only interested i 阅读全文
posted @ 2018-11-26 12:22 落星无尘_Will 阅读(301) 评论(0) 推荐(0)