Time Complexity

Правка en1, от rahul_1234, 2016-01-16 23:23:54

Can anybodyt help to find complexity oof this algo: T(n) = n^ (1/3) T( sqrt( n) ) + 2n

I solved it and found it be O(n) but is it correct? Please confirm.

Теги time complexity

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский rahul_1234 2016-01-16 23:23:54 173 Initial revision (published)