Complete the accumulate function template which adds up all the values between two pointers, beg and end. The pointers both point to an element in a vector. Include both end points. This is different than the standard algorithm. pointers.h 1 #ifndef POINTERS H #define POINTERS H 3 4 template I accumulate(const T* beg, const T* end) 6 { 7 T result{}; 9. 10 11 return result; } 13 12 14 #endif Tester.cpp 1 #include 2 #include using namespace std; 4 3 5 #include "pointers.h" 7 int main() { vector v{1, 2, 3, 4, 5, 6}; cout « accumulate(&v[0], &v[0]) « endl; cout « "Expected: 1" <« endl; cout « accumulate(&v[0], &v[1]) « endl; cout « "Expected: 3" « endl; cout « accumulate(&v[0], &v[5]) « endl; cout <« "Expected: 21" « endl; cout « accumulate(&v[3], &v[4]) « endl; cout « "Expected: 9" << endl; } 9 10 11 12 13 14 15 16 17 18
Complete the accumulate function template which adds up all the values between two pointers, beg and end. The pointers both point to an element in a vector. Include both end points. This is different than the standard algorithm. pointers.h 1 #ifndef POINTERS H #define POINTERS H 3 4 template I accumulate(const T* beg, const T* end) 6 { 7 T result{}; 9. 10 11 return result; } 13 12 14 #endif Tester.cpp 1 #include 2 #include using namespace std; 4 3 5 #include "pointers.h" 7 int main() { vector v{1, 2, 3, 4, 5, 6}; cout « accumulate(&v[0], &v[0]) « endl; cout « "Expected: 1" <« endl; cout « accumulate(&v[0], &v[1]) « endl; cout « "Expected: 3" « endl; cout « accumulate(&v[0], &v[5]) « endl; cout <« "Expected: 21" « endl; cout « accumulate(&v[3], &v[4]) « endl; cout « "Expected: 9" << endl; } 9 10 11 12 13 14 15 16 17 18
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...
Related questions
Question
C++ Please help!
![Complete the accumulate function template which adds up all the values between two pointers, beg
and end. The pointers both point to an element in a vector. Include both end points. This is different
than the standard algorithm.
pointers.h
1
#ifndef POINTERS H
2
#define POINTERS H
3
4
template <typename T>
5
I accumulate(const T* beg, const T* end)
6.
7
T result{};
10
return result;
}
11
12
13
14
#endif
Tester.cpp
1
#include <iostream>
#include <vector>
using namespace std;
4
3
5
#include "pointers.h"
7
int main()
8.
vector<int> v{1, 2, 3, 4, 5, 6};
cout <« accumulate(&v[0], &[0]) « endl;
cout « "Expected: 1" « endl;
cout « accumulate(&v[0], &v[1]) « endl;
cout « "Expected: 3" « endl;
cout « accumulate(&v[0], &v[5]) « endl;
cout « "Expected: 21" <« endl;
cout <« accumulate(&v[3], &[4]) « endl;
cout « "Expected: 9" « endl;
}
9.
10
11
12
13
14
15
16
17
18
CodeCheck
Reset](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F930dba79-0d29-4e51-b7ee-c49d28417990%2Fe0db2b14-0470-40de-8e97-6937567c15dc%2F8evu1rv_processed.png&w=3840&q=75)
Transcribed Image Text:Complete the accumulate function template which adds up all the values between two pointers, beg
and end. The pointers both point to an element in a vector. Include both end points. This is different
than the standard algorithm.
pointers.h
1
#ifndef POINTERS H
2
#define POINTERS H
3
4
template <typename T>
5
I accumulate(const T* beg, const T* end)
6.
7
T result{};
10
return result;
}
11
12
13
14
#endif
Tester.cpp
1
#include <iostream>
#include <vector>
using namespace std;
4
3
5
#include "pointers.h"
7
int main()
8.
vector<int> v{1, 2, 3, 4, 5, 6};
cout <« accumulate(&v[0], &[0]) « endl;
cout « "Expected: 1" « endl;
cout « accumulate(&v[0], &v[1]) « endl;
cout « "Expected: 3" « endl;
cout « accumulate(&v[0], &v[5]) « endl;
cout « "Expected: 21" <« endl;
cout <« accumulate(&v[3], &[4]) « endl;
cout « "Expected: 9" « endl;
}
9.
10
11
12
13
14
15
16
17
18
CodeCheck
Reset
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 5 steps with 3 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY