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!
Follow Math Help Forum on Facebook and Google+
Originally Posted by inzaghina 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! It seems to me that n=0 will work.
yes.. and then.. nothing will work
View Tag Cloud