What is recurrence relation? How it can be solved? Show that time complexity of the recurrence relation T(n) = 2T(n/2) + 1 is O(n) using substitution method.

  • Answered by
  • 0 Comments
  • 4 months ago

This answer is restricted. Please login to view the answer of this question.

Login Now
Leave your Answer:

Click here to submit your answer.

s
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments