Skip to content

MIT OCW Introduction to Algorithms

Saturday, 1 February 2014

Part of the Open Courseware offerings at MIT, the 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,” features complete lecture notes and videos, and is also taught as part of the Singapore-MIT Alliance. (complete description here)

the complete playlist of 47 videos can be found here.

From → online learning

Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


Fresh hacks every day

Don Charisma

because anything is possible with Charisma

The Grand Narrative

Korean Feminism, Sexuality, Popular Culture


This site is the bee's knees


helps you have more fun with knowledge creation

Ask a Korean!

rebooting a coding journey

Stupid Ugly Foreigner

Walk softly and carry a big stick. You'll need it to fight the monkeys.

Gusts Of Popular Feeling

rebooting a coding journey

I'm no Picasso

rebooting a coding journey

The Daily Post

The Art and Craft of Blogging

%d bloggers like this: