MIT's Introduction to Algorithms, Lectures 4 and 5: Sorting

You're replying to a comment by Peteris Ledins.

Peteris Ledins Permalink
October 28, 2008, 08:47

I had trouble with the integral method, but this one says why so it:
here
Basically, to find and upper bound of a sum (from a to b), integrate the f-n from a to b+1 (which makes sense after 2 minutes of looking at those notes).

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 the first letter of your name: (just to make sure you're a human)

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