Write a C++ program, no need to be object-oriented, to test the following three functions. Each function receives one parameter n, which is a positive integer. int F1(int n) { if (n if (n % 2 int result 0) return 1; 0) { F1(n / 2); return result * result; else 1); return 2 * F1(n } int F2(int n) { if (n return 2 * F2(n - 1); 0) return 1; int F3(int n) { if (n 0) return 1; return F3(n - 1) + F3(n - 1); } Test the functions by calling them with the following values for n: 1, 3, 5, 16, 24, 26, 30. Submit your test program and in your report answer the following questions: a. What does each function return as a function of input parameter n? b. Which function is the worst in terms of time efficiency? Support your answer by stating, without proof, the running time growth rate, as a function of n, of each of the above functions.
Write a C++ program, no need to be object-oriented, to test the following three functions. Each function receives one parameter n, which is a positive integer. int F1(int n) { if (n if (n % 2 int result 0) return 1; 0) { F1(n / 2); return result * result; else 1); return 2 * F1(n } int F2(int n) { if (n return 2 * F2(n - 1); 0) return 1; int F3(int n) { if (n 0) return 1; return F3(n - 1) + F3(n - 1); } Test the functions by calling them with the following values for n: 1, 3, 5, 16, 24, 26, 30. Submit your test program and in your report answer the following questions: a. What does each function return as a function of input parameter n? b. Which function is the worst in terms of time efficiency? Support your answer by stating, without proof, the running time growth rate, as a function of n, of each of the above functions.
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
Related questions
Question
Please help me with question b to find the running time. Thank you.

Transcribed Image Text:Write a C++ program, no need to be object-oriented, to test the following three functions. Each function
receives one parameter n, which is a positive integer.
int F1(int n)
{
if (n
if (n % 2
int result
0) return 1;
0) {
F1(n / 2);
return result * result;
else
1);
return 2 * F1(n
}
int F2(int n)
{
if (n
return 2 * F2(n - 1);
0) return 1;
int F3(int n)
{
if (n
0) return 1;
return F3(n - 1) + F3(n - 1);
}
Test the functions by calling them with the following values for n: 1, 3, 5, 16, 24, 26, 30.
Submit your test program and in your report answer the following questions:
a. What does each function return as a function of input parameter n?
b. Which function is the worst in terms of time efficiency? Support your answer by stating, without
proof, the running time growth rate, as a function of n, of each of the above functions.
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 3 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

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education