Computational complexity: Difference between revisions

Revision as of 22:30, 2 September 2022

Revision as of 22:30, 2 September 2022

Line 1:

{{Short description|Amount of resources to perform an algorithm}}

{{Shordateno footnotes|date=December 2017}}

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 [[time complexity|time]] and [[space complexity|memory]] requirements. The complexity of a [[computational problem|problem]] is the complexity of the best algorithms that allow solving the problem.