Video details loaded
HomeMIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method
MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

Video 2 of 10

Previous: Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, MergesortNext: Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method

1:10:31

Up Next

Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

Continue

Topics covered: Asymptotic Notation - Recurrences - Substitution, Master Method

Instructors: Prof. Erik Demaine, Prof. Charles Leiserson