CS Degree Day 47

6.1210. Introduction to Algorithms. The subject that separates programmers from computer scientists. I say this not to be self-aggrandizing but because I have met many working developers who cannot implement a binary search correctly under mild pressure.

What I did today?

• Lecture 1: Model of computation, RAM model, time complexity
• Lecture 2: Sorting - insertion sort, merge sort analysis
• Problem set: Prove that insertion sort is O(n²)

The formalism requires the sigma notation, the asymptotic argument which is something I learned in 6.1200J.