Question

QUESTION 6 Given algorithm A(n): A(n): { An/2); for i = 1 to n sum++; A(n/2); } Fill in the appropriate expressions in the box provided: T(n) = TO QUESTION 7 Given algorithm A(n): A(n): {for i = 1 to n sum++; Ain/2); } Fill in the appropriate expressions in the box provided: T(n) = TO

Answer 1

Question 6)

Answer:

$T(n) = 2T(n/2) + \Theta (n)$

2T(n/2 )is due to two recursive calls made for A(n/2)

is due to the for loop which runs from i = 1 to n

ије

You can also write the answer as:

Since there is only one for loop.

-----------------------------------------------------------

Question 7)

Answer:

$T(n) = T(n/2) + \Theta (n)$

T(n/2 )is due to one recursive calls made for A(n/2)

is due to the for loop which runs from i = 1 to n

ије

You can also write the answer as:

Since there is only one for loop.

-----------------------------------------------------------

Question 8)

Answer:

$T(n) = 2T(n/4) + \Theta (n)$

2T(n/4 )is due to two recursive calls made for A(n/4)

is due to the for loop which runs from i = 1 to n

ије

You can also write the answer as:

Since there is only one for loop.

-----------------------------------------------------------

I hope this helps you,

Please rate this answer if it helped you,

Thanks for the opportunity