W2022 CS 340 Lecture 4: Complexity Analysis and Asymptotic Notation

During this class we had a couple power outages, I put some fun inserts into the one that happened during the middle of lecture, so enjoy. In today's class, with the time we had, we finished up our discussion of complexity analysis and began discussing Big-Oh notation and its cousins, Big-Omega and Big-Theta, among others.

Note: I am making the notes for the examples for using these notations available in advance if you want to get ahead on the assignment or see how to use them.

Time Stamps
0:00 Opening, Recap
1:58 Summary of complexity analysis, simplified techniques
17:57 Big-Oh
30:40 Power goes out, usage of Big-Oh, why use Big-Oh to compare algorithms?
52:50 Big-Omega, Big-Theta, Little-Oh, Little-Omega