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
Questions by mohitrai0_0
1
votes
6
answers
1
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. There is no mention to it in CLRS book. Please help. Thanks in advance.
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. Th...
19.6k
views
asked
Sep 28, 2018
Algorithms
recurrence-relation
algorithms
master-theorem
time-complexity
asymptotic-notation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register