Consider the following functions for problems 3 and 4. int max(int[] array, int

Question

Consider the following functions for problems 3 and 4. int max(int[] array, int first, int last) { if (first == last) return array[first]; else if (first + 1 == last) return max(array[first], array[last]); else { int mid = (first + last) / 2; return max(max(array, first, mid), max(array, mid + 1, last)); } } int max(int left, int right) { if (left > right) return left; return right; } 3. Write the recurrence equation that expresses the execution time cost for the above algorithm. Draw the recursion tree assuming that n = 8. 4. Determine the critical exponent for the recurrence equation in problem 3 Apply the Little Master Theorem to solve that equation. Is this algorithm optimal? Explain.

Explanation / Answer

double power(double base, int exponent) { double result = 1; for (int i = 1; i

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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