Show that the solution of T(n) = T(n 1) + n is O(n 2 ).

Question:

Show that the solution of T(n) = T(n – 1) + n is O(n2).

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: