// Ex. 7.17: Ex07_17.cpp 2 I/ What does this program do? #include 4 #include 5 using namespace std; 6 1 const size_t arraySize{10}; 8 int whatIsThis(const array&, size_t); // prototype o int main() { array a{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int result{whatIsThis(a, arraySize)}; 5 cout « "Result is " « result « endl; 6 } // What does this function do? int whatIsThis (const array& b, size_t size) { if (size -- 1) { // base case return b[0]; else { // recursive step return b[size - 1] + whatIsThis (b, size - 1); 6

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
What does the following program do?
Fig. 7.23 What does this program do?
// Ex. 7.17: Ex07_17.cpp
2
// What does this program do?
3
#include <iostream>
4 #include <array>
5 using namespace std;
6
7 const size_t arraySize{10};
8 int whatIsThis(const array<int, arraySize>&, size_t); // prototype
int main() {
array<int, arraySize> a{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
10
12
int result{whatIsThis (a, arraysize)};
13
14
15
cout <« "Result is
<« result << endl;
16
17
// What does this function do?
int whatIsThis(const array<int, arraySize>& b, size_t size) {
if (size -- 1) { // base case
return b[0];
}
else { // recursive step
return b[size - 1] + whatISThis (b, size
}
18
19
20
22
23
24
25
26
1);
-NNN
Transcribed Image Text:// Ex. 7.17: Ex07_17.cpp 2 // What does this program do? 3 #include <iostream> 4 #include <array> 5 using namespace std; 6 7 const size_t arraySize{10}; 8 int whatIsThis(const array<int, arraySize>&, size_t); // prototype int main() { array<int, arraySize> a{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 10 12 int result{whatIsThis (a, arraysize)}; 13 14 15 cout <« "Result is <« result << endl; 16 17 // What does this function do? int whatIsThis(const array<int, arraySize>& b, size_t size) { if (size -- 1) { // base case return b[0]; } else { // recursive step return b[size - 1] + whatISThis (b, size } 18 19 20 22 23 24 25 26 1); -NNN
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY