<p>Consider an algorithm that solves problems of size n by recursively solving o

Question

<p>Consider an algorithm that solves problems of size n by recursively solving one subproblem of size n/3, one subproblem of size n/2, and one subproblem of size 2n/3 and then combining the solutions in linear time.</p>
<p>Calculate the running time of this algorithm by:<br />a) Evaluating the recurrence relation in full , ex 2T(n/2)+ fⁿ&#160; ...</p>
<p>b) and by applying master theorem, if possible</p>
<p>&#160;</p>
<p>Please be detailed so that I can follow, Thanks!</p>

Explanation / Answer

                     a is number of sub problems

                    n/b is size of each sub problem

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

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