Computational complexity

Amount of resources to perform an algorithm

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem.

This keyword could refer to multiple things. Here are some suggestions: