wing recurs ALGORITHM Q(n) I/Input: A positive integer n if n =1 return 1 else return Q(n – 1) +2 * n – 1 a. Set up a recurrence relation for this function's values and solve it to det mine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by t algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions ma

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
4. Consider the following recursive algorithm.
ALGORITHM Q(n)
//Input: A positive integer n
if n = 1 return 1
else return Q(n – 1) + 2 * n – 1
a. Set up a recurrence relation for this function's values and solve it to deter-
mine what this algorithm computes.
b. Set up a recurrence relation for the number of multiplications made by this
algorithm and solve it.
c. Set up a recurrence relation for the number of additions/subtractions made
by this algorithm and solve it.
Transcribed Image Text:4. Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1 else return Q(n – 1) + 2 * n – 1 a. Set up a recurrence relation for this function's values and solve it to deter- mine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it.
Expert Solution
Step 1

1- Since you have not provided the language to write the code so I am using java language to solve this algorithm. 


2- In this assignment, take the positive input from the scanner class. 


3- This is a recursive algorithm, the purpose of the recursive method call to itself till the condition is not satisfied. 


4- There are if and else condition require because if the user enters the value 1, it will return 1 only. If the user enters more than 1 value it will calculate and return this value (n-1) + 2 * n-1.


5- Call the recursive method from the main class. 


6- Please check the following complete example with comments and screenshots.
 
 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Fibonacci algorithm
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