We can evaluate an algorithm's performance in four ways:
Completeness: Is the algorithm guaranteed to find a solution when there is one?
Optimality: Does the strategy find the optimal solution?
Time complexity: How long does it take to find a solution?
Space complexity: How much memory is needed to perform the search? (查看原文)
必读书，不过内容已很多过时 p1027 A strong challenge to functionalism has been mounted by John Searle’s (1980) biological naturalism, according to which mental states are high-level emergent features that are caused by low-level physical processes in the ne...
(展开)
只不过是上过peter大神udacity的课程以后的笔记不知道放哪里合适 # Udacity CS212: Design of computer programs - Peter Norvig ## Lesson 2: aspect oriented programming: disentangling the correctness, efficiency, debugging aspect of the program. **seperation of a...
(展开)
yang_bigarm
人民邮电出版社2004版
sandorf
清华大学出版社2006版
汪杨
Pearson1994版
badxy
Pearson1998版
还没人写过短评呢
还没人写过短评呢