更改

The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory. Both areas are highly related, as the complexity of an algorithm is always an upper bound on the complexity of the problem solved by this algorithm.

The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory. Both areas are highly related, as the complexity of an algorithm is always an upper bound on the complexity of the problem solved by this algorithm.

对明确给定算法的复杂度的研究叫做'''<font color="#ff8000">算法分析 analysis of algorithm</font>'''，而对问题复杂性的研究叫做'''<font color="#ff8000">计算复杂度理论 computation complexity theory</font>'''分析。这两个领域是高度相关的，因为算法的复杂度一直是该算法求解问题复杂度的'''<font color="#ff8000">上限 upper bound</font>'''。

对明确给定算法的复杂度研究叫做'''<font color="#ff8000">算法分析 analysis of algorithm</font>'''，而对'''<font color="#ff8000">数学题 problem</font>'''的复杂度研究叫做'''<font color="#ff8000">计算复杂度理论 computation complexity theory</font>'''分析。这两个领域是高度相关的，因为算法的复杂度一直是该算法数学求解问题复杂度的'''<font color="#ff8000">上限 upper bound</font>'''。