Cover of 6. Image courtesy of MIT Press. Cite This Course. Don't show me this again. This is one of over 2, courses on OCW. Find materials for this course in the pages linked along the left.
|Published (Last):||21 May 2019|
|PDF File Size:||5.30 Mb|
|ePub File Size:||19.94 Mb|
|Price:||Free* [*Free Regsitration Required]|
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.
Course Homepage 6. Thank you so much for posting these lectures. 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. I'm looking for network flows max-min cut problems , do you know if there is a video lecture on this topic? Thank you Mr. 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. 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. 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 ? 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. Thanks for the OCW,the lectures of mit are so good ,i hopt that more and more courses will come out. Thanks a lot. 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.
I recommend to to see the 6. I am glad to see this quality stuff First , when I found this 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. Thanks for ur quality of teaching I really enjoyed all of your lectures If possible arrange all computer science lecture thank you soo much.
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. I'll come back to see all of them. 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. 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.
Now I feel like I am not going back to plantations to pick rice! 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. Thank you MIT for these amazing lectures. Thank you professors for such clear explanations. Please make lectures 20 and 21 available. Thanks a lot for this knowledgeable lectures. I didn't get a single chance to loose my interest.
Introduction to Algorithms (SMA 5503)
18.410J Introduction to Algorithms (SMA 5503)
Reviews and comments: