Lecture 22: Big Oh and Theta
This lecture explores how to compare the efficiency of algorithms by using notation that describes growth independent of machine or specific implementation. It shows how to use Theta to describe asymptotic order of growth as well as upper and lower bounds.
Course Info
Instructor
Departments
As Taught In
Fall
2022
Level
Learning Resource Types
theaters
Lecture Videos
notes
Lecture Notes
assignment
Problem Sets
assignment_turned_in
Programming Assignments with Examples
Readings
Recitation Notes
