Graphs of functions commonly used in the analysis of algorithms, showing the number of operations N as the result of input size n for each function In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performe
![Time complexity - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/61a1a81b0408e1b93285de99172cfe05f13b0bd8/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2F7%2F7e%2FComparison_computational_complexity.svg%2F1200px-Comparison_computational_complexity.svg.png)