By simplydns
via catonmat.net
Published: Nov 20 2008 / 15:04
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.
Add your comment
Voters For This Link (20)
-
simplydns -
bloid -
pkrumins -
lacrecderz -
ssuravarapu -
vojkog -
miphol -
Kinko -
aroberge
-
rsmaniak
-
mswatcher -
acconrad
-
alashcraft -
izittm
-
ashayh
-
otb82
-
aruggles
-
yardena -
puredanger -
davneter
