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
Answers by akshat16
1
votes
1
Self Doubt[Gate Question]
Let T(n) be a function defined by the recurrence T(n)=2T(n/2)+√n for n≥2 andT(1)=1 Can someone please explain solution of this using back substitution
Let T(n) be a function defined by the recurrence T(n)=2T(n/2)+√n for n≥2 andT(1)=1Can someone please explain solution of this using back substitution
352
views
answered
Jan 14, 2019
Algorithms
algorithms
recurrence-relation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register