You're replying to a comment by Arslan Asif.

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

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Type the word "linux_84": (just to make sure you're a human)

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