Tuesday, February 22, 2011

Going through MIT open courseware for Introduction to Algorithms

The complete class is available online. I am making a playlist of it as I go through it:

Awesome stuff.
Here's what is covered in Lecture One:

  • Insert Sort
  • Merge Sort
  • Theta notation demonstrated for these two sorts
  • Cool: How to determine the complexity ( asymptotic analysis for runtime ) for an algorithm that uses recursion (in this case merge sort) 
Check it out: 

After the lecture you can enjoy this comic:
haha merge sort for 5 items .....