Summary of all the MIT Introduction to Algorithms lectures

You're viewing a comment by Bill and its responses.

Bill Permalink
November 12, 2009, 13:42

In the description of lecture 2 you make a small, but important error.

You say f(n) = O(n^2) means function f(n) is always smaller than or equal to n^2, but that's not exactly right. For example, 2*n^2 is O(n^2), but it is always greater than n^2. So f(n) = O(n^2) means f(n) is smaller than c*n^2 for some constant c. Also, it is important to note that f(n) only needs to be greater than c*n^2 for large values of n. For example, n > n^2 if -1

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.