1. Engineering
  2. Computer Science
  3. 2 consider the recurrence tn 2tn2 fn in which...

Question: 2 consider the recurrence tn 2tn2 fn in which...

Question details

2. Consider the recurrence T(n) 2T(n/2) + f(n) in which f(n)-( n, n2 if「log(n)|is even otherwise (a) Prove that T(n)-O(n3) by induction. (b) Show that f(n) = Ω(nlogb(a)+-) for some e> 0 and use master theo- rem to solve this recurrence.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution