Home »Computer Science »MIT » Introduction to Algorithms



Introduction to Algorithms

Lecture 1: Introduction - Analysis of Algorithms, Insertion Sort, Mergesort

Embed
Download:   mp3 download MP4,FLV & 3GP 55460 views

SEE: Guide to Download MIT Video Lecture

Course Description :

Contents:
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

Other Resources :

Handouts | Citation |

These free video lectures are licensed under a Creative Commons License by MIT OCW

Other Computer Science Courses

» check out the complete list of Computer Science lectures          

 

Get Your Degree!

Find schools and get information on the program that’s right for you.

Powered by Campus Explorer

Comments

Post your Comments