MIT 6.100L Introduction to CS and Programming using Python, Fall 2022
Instructor: Ana Bell
View the complete course: ocw.mit.edu/courses/6-100l-in...
KZread Playlist: • MIT 6.100L Introductio...
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.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s KZread and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.