This paragraph is useful because it clears up some potential confusion between how computational complexity theory and algorithmic analysis are used: > Yet ano

This paragraph is useful because it clears up some potential confusion between how computational complexity theory and algorithmic analysis are used: > Yet another subject related to computational complexity theory is algorithmic analysis (e.g. Knuth (1973), Cormen, Leiserson, and Rivest 2005). Like computational complexity theory, algorithmic analysis studies the complexity of problems and also uses the time and space measures `t_M(n)` and `s_M(x)` defined above. The methodology of algorithmic analysis is different from that of computational complexity theory in that it places primary emphasis on gauging the efficiency of specific algorithms for solving a given problem. On the other hand, in seeking to classify problems according to their degree of intrinsic difficulty, complexity theory must consider the efficiency of all algorithms for solving a problem. Complexity theorists thus make greater use of complexity classes such as P, NP, and PSPACE whose definitions are robust across different choices of reference model. In algorithmic analysis, on the other hand, algorithms are often characterized relative to the finer-grained hierarchy of running times `log_2(n)`, `n`, `n log_2(n)`, `n^2`, `n^3`, ... within P. Source: https://plato.stanford.edu/entries/computational-complexity/ https://plato.stanford.edu/entries/computational-complexity/ Note: I've done some light edits so the mathematics are roughly in LaTeX syntax; e.g. `_` for subscripts.