Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty. Particularly common in programming is *amortized analysis* for time or space

- Wiki
1 articles, 0 books.

Between two extrinsically identical algorithms, the one that can be expressed - or implemented, as it were - with less characters is fundamentally simpler in the context of the problem domain.