How to Calculate Complexity for Recursive Algorithms
By Stephanie Ellen
, last updated March 13, 2012
The representation of algorithms by recursive programs, or programs that solve a problem by breaking that problem into smaller components, is used in complexity theory. Complexity theory is particularly applicable to computer science, where it's important to know how much run time a particular function might have. Recurrence relations, a relationship where the function T(..) appears on both sides of the equals sign, can be used to calculate the time complexity of recursive functions.