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:
http://www.youtube.com/user/basaratali?feature=mhum#p/c/A7062CB4B95A85BA

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: 

http://www.youtube.com/user/basaratali?feature=mhum#p/c/A7062CB4B95A85BA/0/JPyuH4qXLZ0

After the lecture you can enjoy this comic:
http://www.smbc-comics.com/index.php?db=comics&id=1989
haha merge sort for 5 items .....