Lecture 23: Complexity Classes Examples

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...
CZcams Playlist: • MIT 6.100L Introductio...
This lecture looks at complexity classes to compare the efficiency of algorithms, lower order of growth, and use Θ for an upper and lower (“tight”) bound.
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 CZcams 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.

[@sumedhchipde6097]

At 42:00 the formula being used is the sum of first n natural numbers: 1 + 2 +3 +.....+n is give by n × (n+1) / 2.
You can derive it by sum of an arithmetic progression with a =1 and d=1.

[@aguinaldomulondemulonde7800]

yes , you can PA

[@chrisgrad9004]

At 40:20 Why intereting over tmp does not increase the complexity ? Given that we only look at the worse case scenario like she said 1 lecture ago ? I'm a bit confused. Shouldn't it be 2×(θ(Len(L1) × Len(L2))?