An approach to classify algorithms by complexity

Abstract

Computers run programs that are representations of an algorithm. Computational complexity refers to measures to evaluate the efficiency of algorithms. Two resource types are investigated typically: time and space complexities.

Time complexity is defined as the amount of time of time requires to execute each statement of the algorithm