Explore relationships

Exponential time

Estimate of time taken for running an algorithmGraphs of functions commonly used in the analysis of algorithms, showing the number of operations N{\displaystyle N} as the result of input size n{\displaystyle n} for each functionIn theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.

Use + to expand a branch. Click a topic name to open its summary.