Here are an excerpt from Lecture 1 transcript http://dpaste.com/252190/plain/ http://dpaste.com/252190/plain/, and a version of it bastardized by MacOS X Summar

Here are an excerpt from Lecture 1 transcript http://dpaste.com/252190/plain/ http://dpaste.com/252190/plain/, and a version of it bastardized by MacOS X Summarize service set to up to produce a very short paragraph summary below. > There is always going to be some point n_o where for everything larger the Theta(n^2) algorithm is going to be cheaper than the Theta(n^3) algorithm not matter how much advantage you give it at the beginning in terms of the speed of the computer you are running on. Or maybe not so much bastardized. That is to say – it can probably be done.