In this lesson, we learn about arithmetic and geometric sums, how to represent and compute them, and how to write closed forms. We start off by looking at a simple recurrence equation of how much money you have in the bank and then move on to solving more complex recurrence equations. We then analyze the binary search algorithm and derive a big theta log N algorithm, which is a very fast algorithm for searching through large amounts of data. Overall, this lesson provides a good foundation for understanding and solving various mathematical problems using recurrence equations.
Learn about arithmetic and geometric sums, how to represent and compute them, and how to write closed forms.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/