3. Draw the recursion tree when n = 12, where n represents the length of the array, for the following recursive method: int sumSquares (int[] array, int first, int last) ( if (first == last) return array [first] * array[first]; int mid (first + last) / 2; return sumSquares (array, first, mid) + sumSquares (array, mid + 1, last); } • Determine a formula that counts the numbers of nodes in the recursion tree. What is the Big-Ⓒ for execution time? • Determine a formula that expresses the height of the tree. What is the Big-Ⓒ for memory? • Write an iterative solution for this same problem and compare its efficiency with this recursive solution.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

need ans of part 5

3. Draw the recursion tree when n = 12, where n represents the length of the array, for the
following recursive method:
int sumSquares (int[] array, int first, int last) {
if (first == last)
return array [first] array[first];
}
int mid = (first + last) / 2;
return sumSquares (array, first, mid) +
sumSquares (array, mid + 1, last);
● Determine a formula that counts the numbers of nodes in the recursion tree.
•
What is the Big-Ⓒ for execution time?
•
Determine a formula that expresses the height of the tree.
What is the Big-Ⓒ for memory?
Write an iterative solution for this same problem and compare its efficiency with this
recursive solution.
Transcribed Image Text:3. Draw the recursion tree when n = 12, where n represents the length of the array, for the following recursive method: int sumSquares (int[] array, int first, int last) { if (first == last) return array [first] array[first]; } int mid = (first + last) / 2; return sumSquares (array, first, mid) + sumSquares (array, mid + 1, last); ● Determine a formula that counts the numbers of nodes in the recursion tree. • What is the Big-Ⓒ for execution time? • Determine a formula that expresses the height of the tree. What is the Big-Ⓒ for memory? Write an iterative solution for this same problem and compare its efficiency with this recursive solution.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 1 images

Blurred answer
Knowledge Booster
Heapsort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education