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?引自 3.3.2 Measuring problem-solving performance
表示其中内容是对原文的摘抄