Computer Science Distilled: Learn the Art of Solving Computational Problems (Code is Awesome)

by Wladston Ferreira Filho

Time complexity is written (n. It gives the number of operations the algorithm performs when processing an input of size n. We also refer to an algorithm's (n) as its running cost.