Classes of Time Complexity

Learn classes of time complexity in this lesson.


The running time (cf. definition :Running_Time ) or time complexity of an algorithm measures or estimates the maximum number of steps that an algorithm uses on any input of length nn and thus gives an estimation of its time taken to proceed.

As outlined in this lesson, we commonly consider the worst-case time complexity, which is given by the maximum number of steps and thus by the maximum amount of time taken on inputs of a particular size nn. Obviously, the maximum time to execute an algorithm on a given input nn depends on its complexity and thus increases with nn. The most common time complexity classes are figured in this table :Efficiency_of_Alg_table_1 with increasing order.

Get hands-on with 1200+ tech skills courses.