Hello!

I have been asked to solve the following recurrence problem (in order to see the complexity of an algorithm) :

T(n)= T(n/2 + sqrt(n)) + n

Do you have any idea of solving it ?

Thank you very much!

Printable View

- Nov 22nd 2009, 11:15 AMinzaghinaRecurrence problem
Hello!

I have been asked to solve the following recurrence problem (in order to see the complexity of an algorithm) :

T(n)= T(n/2 + sqrt(n)) + n

Do you have any idea of solving it ?

Thank you very much! - Nov 23rd 2009, 02:44 PMBill Zimmerly
- Nov 24th 2009, 02:53 AMinzaghina
yes..

and then.. nothing will work