18.410J Introduction to Algorithms (SMA 5503)

Course Description


This course features a complete set of lecture notes and videos. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.



Tags: Math, Math Algorithms

Copyright Information

Erik Demaine and Charles Leiserson, 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Compute... (Accessed December 22, 2008). License: Creative commons BY-NC-SA
18.410J Introduction to Algorithms (SMA 5503)

Cover of 6.046J textbook, Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest, and Stein. (Image courtesy of MIT Press.)
2 ratings

Video Lectures & Study Materials

# Lecture Play Lecture
1 Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort (1:20:36) Play Video
2 Asymptotic Notation - Recurrences - Substitution, Master Method (1:10:31) Play Video
3 Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication (1:08:33) Play Video
4 Quicksort, Randomized Algorithms (1:20:33) Play Video
5 Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort (1:16:51) Play Video
6 Order Statistics, Median (1:08:49) Play Video
7 Hashing, Hash Functions (1:17:40) Play Video
8 Universal Hashing, Perfect Hashing (1:19:47) Play Video
9 Relation of BSTs to Quicksort - Analysis of Random BST (1:21:23) Play Video
10 Red-black Trees, Rotations, Insertions, Deletions (1:23:51) Play Video
11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees (1:23:45) Play Video
12 Skip Lists (1:25:32) Play Video
13 Amortized Algorithms, Table Doubling, Potential Method (1:19:06) Play Video
14 Competitive Analysis: Self-organizing Lists (1:14:28) Play Video
15 Dynamic Programming, Longest Common Subsequence (1:11:00) Play Video
16 Greedy Algorithms, Minimum Spanning Trees (1:24:08) Play Video
17 Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search (1:24:33) Play Video
18 Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints (1:17:17) Play Video
19 Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson (1:14:59) Play Video
22 Advanced Topics (1:15:08) Play Video
23 Advanced Topics (cont.) (1:16:48) Play Video
24 Advanced Topics (cont.) (1:24:48) Play Video
25 Advanced Topics (cont.) - Discussion of Follow-on Classes (1:25:21) Play Video

Comments

Displaying 1 comment:

sam wrote 7 years ago.
veryyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy gooooooooooooood

  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)
 
Disclaimer:
CosmoLearning is promoting these materials solely for nonprofit educational purposes, and to recognize contributions made by Massachusetts Institute of Technology (MIT) to online education. We do not host or upload any copyrighted materials, including videos hosted on video websites like YouTube*, unless with explicit permission from the author(s). All intellectual property rights are reserved to MIT and involved parties. CosmoLearning is not endorsed by MIT, and we are not affiliated with them, unless otherwise specified. Any questions, claims or concerns regarding this content should be directed to their creator(s).

*If any embedded videos constitute copyright infringement, we strictly recommend contacting the website hosts directly to have such videos taken down. In such an event, these videos will no longer be playable on CosmoLearning or other websites.