View order

Type of content







...Search a Keyword

event header image

MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

Course Homepage 6.046J / 18.410J Introduction to Algorithms (SMA 5503) Fall 2005

Course features at MIT OpenCourseWare page:

Complete MIT OCW video collection at MIT OpenCourseWare - VideoLectures.NET


Reviews and comments:

Comment1 amith, June 9, 2009 at 11:45 a.m.:

thannxx lot for dis amazing stuff I was in dark when I was attending to my lectures
thanx to this now i can understand my lectures easilyyy

thnx againnn

Comment2 ConfusedStudent, June 19, 2009 at 6:58 p.m.:

Thank you so much for posting these lectures. My lecturer is the most neurotic person alive and lectures *ARE NOT* his gift. He changes examples 3, 4 and 5 times in the middle of a problem and does not explain things too well. And erases before you have any chance to read, comprehend and much less copy it down for later study.

-Confused Student

Comment3 Er. Saurabh Bisht, June 19, 2009 at 11:24 p.m.:

nice lecture but i guess time is off the essence
slide are best examples for it
anyways cant these lectured be compressed for easy download
I have low speed broadband connection and after 10 to 15% of
download it pops off.
g8 going mit

Comment4 Aveek Dasmalakar, July 11, 2009 at 11:59 a.m.:

Excellent lectures on algorithms.Thank you MIT for making available for all.great job

Comment5 akila, July 15, 2009 at 9:17 p.m.:

I can understand all lectures wiith in very short time period, thanx very very much.

Comment6 Omid, July 22, 2009 at 10:30 p.m.:

Only thing i can say is: thanks a lot.

Plz continue this way.
God With you

Comment7, August 19, 2009 at 9:16 p.m.:

hearty thanks and congradulation! do more! i was not able to get thru MIT bt, these lectures made me satisfied!! thanks!! go MIT GOooooooooooooooooooooooo!! great STUFF!!!

Comment8 Kok-Meng Lam, November 6, 2009 at 7:04 a.m.:

I'm looking for network flows (max-min cut problems), do you know if there is a video lecture on this topic?

Thank you.


Comment9 Jure, December 13, 2009 at 12:24 p.m.:

Thank you Mr. professor! I live in Slovenia and because of this lectures I have at least a small taste of your University and a chance to learn from the best.
I would really like for you to introduce distance learning through conferences etc. with a real chance of getting a degree. Payed of course. This way we (people from outside the US and not in their 20's) would have a chance for a real leanings. Well, I know this is just wishful thinking, but maybe sometime in the future...

In any case I like your lectures and am very thankful for you making it available to all of us.
Thank you!
Jure S.

Comment10 Supriya Dsouza, March 15, 2010 at 10:22 a.m.:

Thank you for the video lectures.
It really helped me understand the course and get a taste of MIT.
Would any updates be made for 2010?

Comment11 Patrick, March 16, 2010 at 3:14 a.m.:

Thanks very much...
I am a student from China,
I love computer science,
and algorithm is very importan.
Thanks so much to bring us the video.

Comment12 arup rakshit, March 18, 2010 at 9:19 a.m.:

this is the best lectures yet now for me. but where the lecture 21 and lecture 22.i have not found.can you send me the address of that missing two!

Comment13 sadegh, May 10, 2010 at 8:13 p.m.:

thanks its very very good. i can improve my ability by this website.
thanks very much !

Comment14 CyKy, June 2, 2010 at 8:51 p.m.:

Thanks for all the resources and all the lectures
I`m a student from Romania and for the last 2 months i have discovered OCW and i can`t get enough of it
Mit is the best for providing the world with all this knowledge!

Comment15 koppt, August 23, 2010 at 10:57 a.m.:

Thanks for the OCW,the lectures of mit are so good ,i hopt that more and more courses will come out.Thanks a lot.

Comment16 Rajiv, September 11, 2010 at 8:01 a.m.:

Great lectures on some of the complicated topics. Hope to see more lectures on more courses and hope that many more universities will emulate MIT's principle of sharing the knowledge with the world.

Comment17 Yash, September 17, 2010 at 4:31 p.m.:

Hey Thankyou !!

Comment18 Konstantin, September 18, 2010 at 3:45 p.m.:

Thanks a lot! Really useful and interesting stuff!

Comment19 JohnG, October 28, 2010 at 4:37 a.m.:

Thank you for sharing!

I am a CS student from Greece and those two teachers are great, both motivating, funny and DEEPLY knowledgeable.I recommend to to see the 6.042 lectures/resitacions/assigments/exams with solutions this teacher was a contributor to the lectures and the lectures are just Great --->

Comment20 hongyu, November 2, 2010 at 3:02 a.m.:

Perfect! I love it very much.

Comment21 Vikas, December 27, 2010 at 9:43 a.m.:

This is just amazing.. Thnx MIT for making this happen..

Comment22 jugnu, January 5, 2011 at 4:18 p.m.:

best stuff. lecture 20 and 21 are missing. please include them also.

Comment23 Srikkanth, February 1, 2011 at 2:15 a.m.:

Very Very informative. Three cheers to MIT's opencourseware initiative.

Comment24 nasser, February 14, 2011 at 4:54 a.m.:

that sounds great!
this way is best way to learn science in same level.
all of the student in the world have access to internet.
please continue this way for all course in computer science .
tank's and good luck.
nasser from iran

Comment25 Vikas Kaushik, May 17, 2011 at 11:43 p.m.:

I am glad to see this quality stuff...First , when I found this...was like finding some treasure....

Real thanks....from one more student...thnx....

Comment26 Szy, May 24, 2011 at 1:04 p.m.:

Thanks a lot for these amazing lectures. It is a real pleasure to watch them. I think I have finally understood universal hashing thanks to your wonderful videos.

Greetings from Poland!

Comment27 subbarao, June 10, 2011 at 7:32 a.m.:

Thanks for ur quality of teaching
I really enjoyed all of your lectures
If possible arrange all computer science lecture
thank you soo much

Comment28 Saul Tenzer, June 12, 2011 at 9:07 p.m.:

Thank you from a South African student at the University of Johannesburg in South Africa: These are a great supplement to an already amazing course.

Comment29 Jarvis, June 22, 2011 at 5:05 a.m.:

Thanks for your course!I really appreaciate

Comment30 Anatoly, November 6, 2011 at 9:37 p.m.:

Amazing lectures! Thank you very much!

Comment31 AMYNA, November 14, 2011 at 4:58 p.m.:

MANY Thanks TO ALL, I wach one video and I m very satisfied... I'll come back to see all of them

Comment32 matt, December 5, 2011 at 11:46 p.m.:

What a phenomenal resource. Such a clear and careful presentation of probably the most notoriously difficult course in computer science. If you get stuck on something you can just rewind or go back to the slide if you forget a definition. Really unbelievable.

This in my opinion shows, more than anything else they have done, MIT's absolute commitment to education and knowledge.

thank you. Beautiful material.

Comment33 Tahsin Hassan Rahit, December 13, 2011 at 11:20 a.m.:

Great help. Thank you very much. I want you to continue it. It will be a great help for those who are trying to learn things personally.

Comment34 Konstanz Student, February 26, 2012 at 6:20 p.m.:

I had to prepare to exam.
It was level: ASIAN.


Now I feel like I am not going back to plantations to pick rice! I will be engineer and will be earning all the $$$ in european world, not farming gold in World of Warcarft!

Thanks MIT, now my father is not hitting me with a wooden stick!

Comment35 Alex, April 13, 2012 at 4:33 a.m.:

thank you for the lectures, they are very helpful
as I understand the heapsort algorithm is not explained here?

Comment36 Behrouz, April 26, 2012 at 2:42 p.m.:

Where are the 20 and 21 lectures ?

Comment37 Tun Min, January 27, 2013 at 6:48 p.m.:

Why lectures 20 and 21 have no?

Comment38 axl, April 1, 2013 at 6:04 a.m.:

how can i download these video lectures

Comment39 Omveer, April 22, 2013 at 1:23 p.m.:

This is really a gr8 lecture. Thanks a lot.

Comment40 Atiq, May 30, 2013 at 4:46 p.m.:

Sir Leiserson and Eric, a great source to learn the Algorithms, I haven't even thought to take my area of interest as Algorithms but your books and lectures made everything easy for me, luckily found you and enjoying the Algorithms....

A heartfelt thanks, May God bless you all.
A computer engineering student from India.....Thanking you.

Comment41 Harish, August 8, 2013 at 2:23 p.m.:

Thank you MIT for these amazing lectures. Thank you professors for such clear explanations. Please make lectures 20 and 21 available

Comment42 Prateek, October 11, 2013 at 8:07 p.m.:

Thanks a lot for this knowledgeable lectures.
I didn't get a single chance to loose my interest.
Thanks thanks a lot...

Comment43 frank, March 19, 2014 at 8:23 a.m.:

thanks alot. just that in Bambili, where i am internet connection are too slow.
Please, i really need a complete video tutorial on algorithm

Comment44 ahmad saeed, May 7, 2015 at 8:59 p.m.:

good lectures.

Comment45 Mehzabin , January 6, 2016 at 11:14 a.m.:

Awesome! Keep going MIT! Great job!

Comment46 GreekK, June 21, 2018 at 2:52 p.m.:

This was helpful. Although the quality hasn't aged well Kappa

Comment47 nickvoz, October 13, 2020 at 11:08 p.m.:

It is wonderful to watch this. To develop our talents, we need to learn something new every day of our life. In our time, learning has become both more difficult and easier, harder because curriculum is improving but the level of necessary knowledge is growing. It’s easier because the guys from continue to help students solve problems of varying complexity.

Write your own review or comment:

make sure you have javascript enabled or clear this field: