MIT 6.0001 Introduction to Computer Science and Programming in Python, Fall 2016
View the complete course: http://ocw.mit.edu/6-0001F16
Instructor: Prof. Eric Grimson
In this lecture, Prof. Grimson introduces algorithmic complexity, a rough measure of the efficiency of a program. He then discusses Big "Oh" notation and different complexity classes.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
algorithmic complexitybig ohruntime
0 Comments