MIT's Introduction to Algorithms, Lectures 1 and 2: Analysis of Algorithms

You're viewing a comment by Arslan Asif and its responses.

Arslan Asif Permalink
October 13, 2009, 16:03

Any one tell me what will be the upper bound of following recurrence.

T(n)= T(n-1)+n^2.

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.