Menu

Introduction to Algorithms

MIT,, Fall 2005 , Prof. Erik Demaine

Updated On 02 Feb, 19

Overview

Introduction - Analysis of Algorithms, Insertion Sort, Merge sort - Asymptotic Notation | Recurrences | Substitution, Master Method - Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication- Quick sort, Randomized Algorithms- Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort - Order Statistics, Median-Hashing, Hash Functions-Universal Hashing, Perfect Hashing-Relation of BSTs to Quick sort | Analysis of Random BST - Red-black Trees, Rotations, Insertions, Deletions - Augmenting Data Structures, Dynamic Order Statistics, Interval Trees-Skip Lists - Amortized Algorithms, Table Doubling, Potential Method - Competitive Analysis: Self-organizing Lists-Dynamic Programming, Longest Common Subsequence - Greedy Algorithms, Minimum Spanning Trees - Shortest Paths I: Properties, Dijkstra,Bellman-Ford, Linear Programming, Difference Constraints,ll-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson-Advanced Topics

Includes

Lecture 15: Dynamic Programming, Longest Common Subsequence

4.1 ( 11 )

Lecture Details

Ratings

3.0


2 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send