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
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.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | rahul_1234 | 2016-01-16 23:23:54 | 173 | Initial revision (published) |