The amount of time resources (number of atomic operations or machine steps) required to solve a problem expressed in terms of input size. If your question concerns algorithm analysis, use [tag:runtime-analysis] instead. If your question concerns whether or not a computation will *ever* finish, use [tag:computability] instead. Time-complexity is perhaps the most important sub-topic of [tag:complexity-theory].
Stats
|
created |
7 years, 11 months ago by Sim |
|
viewed |
63 times |
|
editors |
0 |
Top Answerers
more »
Recent Hot Answers
Is there a name for the class of algorithms that are the most efficient for a particular task?Time complexity - Algorithm to find the lowest common ancestor of all deepest leaves
The hardness of solving $x^2=2$
How many times is a for loop executed?
What is the Time complexity of $\sum_{i=1}^n 1+\lfloor\log_2 i\rfloor$
more »
