Discussion Forum on time complexity, self referential structure (Week 2)

Week 2

Week 2

by Arnob Sarker -
Number of replies: 0

Time complexity is simply a measure of the time it takes for a function or expression to complete its task, as well as the name of the process to measure that time. It can be applied to almost any algorithm or function but is more useful for recursive functions.