can you verify the answers to these questions ? Algorithm X solves problems of s

Question

can you verify the answers to these questions ?

Algorithm X solves problems of size n by dividing them into nine subproblems of size n/3 (m/3) each. recursively solving each subproblem, and then combining the solutions with 26.n? (26 n 2) dominating operations. What is the recurrence T a T(m/b) h(n) that describes the number of dominating operations as the function of size n? in your answer type correct value in each of the boxes: Numbers should be entered as usual (e.g. 12, 2017) and any expression should be entered with no spaces between operations.. e.g., 2017 12 r og n 8 should be entered as 2017 x 12+x logn+8 (n) 9 T (n/ 3 26 n 2

Explanation / Answer

Problem 1 seems correct.

But for Q2. recurrence relation will be t(n) = t(n/2) + 1. Therefore, option c is correct.

Q3.) given:

k*sqrt(n) = k*sqrt(1,000,000) = k*(1000) = 20

which gives k = 20/1000

now, for n = 81,000,000; k*sqrt(81,000,000) = (20/1000)*(9000) = 180 sec

= 3 minutes

Hope it helps. Do give your response.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.