Introduction to Algorithms - good coders code, great reuse
This is the ninth post in an article series about MIT’s lecture course “Introduction to Algorithms.” In this post I will review lectures thirteen and fourteen. They are on theoretical topics of Amortized Analysis, Competitive Analysis and Self-Organizing Lists.
Posted November 21, 2008 at 4:03pm
