Tag Archives: recurrence

The time complexity of most recursive algorithms can be represented by a mathematical function called a recurrence. An example of such function is $latex T(n) = T(\frac{n}{2}) + 1$ As you can see, solving for some n involves solving for … Continue reading →