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...
UA-cam 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 UA-cam 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.