Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by aniketpatil32
0
answers
1
#algorithms #recurrence-relation
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
222
views
asked
May 11, 2019
Algorithms
algorithms
recurrence-relation
+
–
0
answers
2
What would be the upper and lower bound for this decreasing function or invalid case? #Algorithm #Asymtotic-notations
481
views
commented
May 10, 2019
Algorithms
algorithms
asymptotic-notation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
