Summary of all the MIT Introduction to Algorithms lectures (2009)

https://catonmat.net/summary-of-mit-introduction-to-algorithms

by addisonc • 6 years ago

158 9 6 years ago

codenlearn• 6 years ago

This was one of the earliest introductions to algorithms which I could understand. Thank you Peter (and MIT OCW) for diligently cataloging the notes, you've no idea how much you helped me to get an understanding of algorithms. Thanks again.

Apart from this his awk,sed and perl oneliners are worth to act as a reference as well.

siegelzero• 6 years ago

His article about bit manipulation is very nice, as well. https://catonmat.net/low-level-bit-hacks

pkaye• 6 years ago

Hackers Delight is a pretty fun book on low level algorithms. Lots of little tidbits like how to convert a divide by a constant into a multiple by a different constants and a shift. Thought these days the compilers are good enough to do the same thing but now when you look at the resulting assembly you can figure out how they are doing that.

tyingq3• 6 years ago

That's a good call-out. It's natural for me, but I do see people struggle with bit manipulation regularly. A comprehensive, yet plain language intro, with simple examples, is really useful.

You can tell this was developed after extensive interactions with undergrads. It's really well done.

mehrdadn• 6 years ago

See https://graphics.stanford.edu/~seander/bithacks.html

chriselles• 6 years ago

Thanks so much! This arrived at exactly the right time for me.

Summary of all the MIT Introduction to Algorithms lectures (2009)

Related Stories