Intro to CS: Lecture 23 - Complexity Classes Examples


Topics: String and List Examples, Analyzing Complexity, Search: indirection, linear search, bisection search

This lecture we are looking at more code and analyzing their complexities. Be careful what the inputs are and whether or not they contribute to the complexity.

Went over a bunch of examples, it was a good practice/review at analyzing a piece of code’s time complexity.

Side note: I’m surprised they didn’t go over the set data structure in Python in this course so far.