Member Avatar for nametso

1)Solve the recurrence
T(n) = 2T(pn) + 1. (*pn means the square root of n)

2)Solve by the recursion tree method
T(n) = 3T(n/2 ) + n

  • 3 Contributors
  • 2 Replies
  • 77 Views
  • 17 Hours Discussion Span
  • Latest Post Latest Post by Rashakil Fol

Recommended Answers

All 2 Replies

Member Avatar for server_crash

I'll do that for you if you do my pre cal homework.

Member Avatar for Rashakil Fol

#1 has a solution but #2, without a set of base cases, is only solvable (I assume the "solution" that you want is for T to be defined in closed form) for one value of n.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.