F2021 CS 340 Lecture 29 (Analyzing Recursive Algorithms, Smoothness, Factorial)

In today's class we began looking at how to analyze recursive algorithms. We will be looking at a few different techniques. Time Stamps: 0:00 Opening/Remarks 0:42 Overview for recursive algorithm analysis 5:40 Eventually Non-Decreasing Functions 11:10 Smoothness, Smooth Functions, Smoothness Rule 33:22 Recursion Trees, Overview of "Guess and Check" 39:35 Example: Factorial (next class we will finish up this example)