摘要: 常见算法的复杂度: 中对算法的讲义是简洁的。特别是:O() notationO(1) access element in array; HashO(lgn) binary search, traveling a binary treeO(n) exhaustive search, find... 阅读全文
posted @ 2015-10-22 11:27 lebyzhao 阅读(121) 评论(0) 推荐(0) 编辑