Question

Given algorithm A(n): A(n): {for i = 1 ton sum++; A(n/2); } Fill in the appropriate expressions in the box provided: T(n) = TO ) + 03 Given algorithm A(n): A(n): { An/3); A(n/3) for i = 1 to n^2 sum++; A(n/3); } Fill in the appropriate expressions in the box provided: T(n) = TO ) + 问题4 Given algorithm A(n): A(n): { A(n/2); SOP ("Hello"); A(n/2); } Fill in the appropriate expressions in the box provided: T(n) = TO

Answer 1

# STAY HOME # STAY SAFE

Ans 2 :

In the given function A(n), for every invocation a loop with n iterations is executed along with a function call of A(n/2).

Therefore, the approximate expression will be T(n) = T(n/2) + n

Ans 3 :

In the given function A(n), for every invocation a loop with n² iterations is executed along with three function calls of A(n/3).

Therefore, the approximate expression will be T(n) = 3T(n/3) + n²

Ans 4 :

In the given function A(n), for every invocation two function calls of A(n/2) are executed.

Therefore, the approximate expression will be T(n) = 2T(n/2)