A- [2 POINTS] Iteration method, then express the result in asymptotic notation . T(n) = n...

Transcribed Image Text:

A- [2 POINTS] Iteration method, then express the result in asymptotic notation . T(n) = n + 4 T(n/4) B- [3 POINTS] Consider the following recursive function then answer the questions below: float foo(int n) ( if(n=1) return 1; else { foo(n/2); } for(int i= 1; i<= n*n; i++) ( print(i); return 10* foo(n/2)* foo(n/2)-2.8* foo(n/2)+1.5* a) [1 POINT] Find the recurrence relation that represents the running time for the above recursive function T(n)= b) [2 POINTS] Solve the recurrence relation using Recursion Tree method. A- [2 POINTS] Iteration method, then express the result in asymptotic notation . T(n) = n + 4 T(n/4) B- [3 POINTS] Consider the following recursive function then answer the questions below: float foo(int n) ( if(n=1) return 1; else { foo(n/2); } for(int i= 1; i<= n*n; i++) ( print(i); return 10* foo(n/2)* foo(n/2)-2.8* foo(n/2)+1.5* a) [1 POINT] Find the recurrence relation that represents the running time for the above recursive function T(n)= b) [2 POINTS] Solve the recurrence relation using Recursion Tree method.

Answer rating: 100% (QA)

A Iteration method for Tn n 4Tn4 Lets analyze the given recurrence relation Tn n 4T... View the full answer