Time Complexity of Algorithms:Definition
The Time Complexity of an Algorithm is a measure of how the time it takes to execute an algorithm grows as a function of the problem size.
Problem Size
Execution Time
Previous slide
Next slide
Back to first slide
View graphic version