Let recursive algorithm F be defined as follows: F(int n): if n=1 then return 1 else return F(n-1)*n (a) i. Assuming x is a positive integer, what mathematical expression is returned by F(x)? ii. Repeat (i) but assume the line “return 1” is replaced by “return 0”?
Let recursive algorithm F be defined as follows: F(int n): if n=1 then return 1 else return F(n-1)*n (a) i. Assuming x is a positive integer, what mathematical expression is returned by F(x)? ii. Repeat (i) but assume the line “return 1” is replaced by “return 0”?
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 17PE
Related questions
Question
100%
Let recursive
F(int n):
if n=1 then
return 1
else
return F(n-1)*n
(a) i. Assuming x is a positive integer, what mathematical expression is returned by F(x)?
ii. Repeat (i) but assume the line “return 1” is replaced by “return 0”?
(b) Which of the following replacements for the last line will yield a function guaranteed to terminate for all valid inputs?
i. return F(n-2)+2
ii. return F( )*2
iii. return F( )*2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
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
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning