Lesson #2
inRecursive Roots

Learn to solve linear recurrences of the form a_n = c * a_{n-1} + g(n) using the method of iteration, applying these skills to analyze the efficiency of computer sorting algorithms.

Similar Lessons