CS210 Lecture 4 (Comparing Algorithms, Complexity, Case-Based Analysis, Model of Computation)

Today we discussed more concepts around analyzing algorithms, and even Ms. Kitty comes and takes down the lecture a notch! When we come back we will see examples of how we can analyze the time complexity of algorithms. Time Stamps: 0:00 Opening, how can we compare algorithms? 4:00 Ms. Kitty disrupts the lecture 6:00 Return to discussion. 12:36 Complexity, complexity function 24:05 Case-based analysis, experimental vs. machine independent approach. 59:00 Model of computation, analysis rules.