Please write the code for the removeBad function using vectors. Will thumbs up if correct!

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

Please write the code for the removeBad function using vectors. Will thumbs up if correct!

E#include <vector>
2
#include <algorithm>
#include <iostream>
4
#include <cassert>
using namespace std;
7
vector<int> destroyedOnes;
8.
ạclass Movie
{
public:
Movie(int r) : m_rating(r) {}
nMovie() { destroyedOnes.push_back(m_rating); }
int rating() const { return m_rating; }
private:
int m_rating;
[};
9
10
11
12
13
14
15
16
17
18
B// Remove the movies in v with a rating below 50 and destroy them.It is acceptable
||// if the order of the remaining movies is not the same as in the original vector.
avoid removeBad (vector<Movie*>& v)
19
20
21
22
23
24
[}
25
26
Evoid test() {
int a[8] = { 85, 80, 30, 70, 20, 15, 90, 10 };
vector<Movie*> x;
for (int k - 0; k < 8; k++)
x.push_back(new Movie(a[k]));
assert(x.size() == 8 && x.front ()->rating() == 85 &&
x.back()->rating() == 10);
removeBad (x);
assert(x.size() == 4 && destroyedOnes.size() == 4);
vector<int> v;
for (int k = 0; k < 4; k++)
v. push_back(x[k]->rating());
sort(v.begin(), v.end());
int expect[4] = { 70, 80, 85, 90 };
for (int k = 0; k < 4; k++)
27
28
29
30
31
32
33
34
35
36
37
38
39
40
assert(v[k] ==
sort(destroyedOnes.begin(), destroyedOnes.end ());
int expectGone[4] = { 10, 15, 20, 30 };
for (int k = 0; k < 4; k++)
assert(destroyedOnes [k] == expectGone[k]);
41
expect[k]);
42
43
44
45
46
47
Bint main()
{
test();
cout <« "Passed" << endl;
48
49
50
51
return 0;
52
53
Transcribed Image Text:E#include <vector> 2 #include <algorithm> #include <iostream> 4 #include <cassert> using namespace std; 7 vector<int> destroyedOnes; 8. ạclass Movie { public: Movie(int r) : m_rating(r) {} nMovie() { destroyedOnes.push_back(m_rating); } int rating() const { return m_rating; } private: int m_rating; [}; 9 10 11 12 13 14 15 16 17 18 B// Remove the movies in v with a rating below 50 and destroy them.It is acceptable ||// if the order of the remaining movies is not the same as in the original vector. avoid removeBad (vector<Movie*>& v) 19 20 21 22 23 24 [} 25 26 Evoid test() { int a[8] = { 85, 80, 30, 70, 20, 15, 90, 10 }; vector<Movie*> x; for (int k - 0; k < 8; k++) x.push_back(new Movie(a[k])); assert(x.size() == 8 && x.front ()->rating() == 85 && x.back()->rating() == 10); removeBad (x); assert(x.size() == 4 && destroyedOnes.size() == 4); vector<int> v; for (int k = 0; k < 4; k++) v. push_back(x[k]->rating()); sort(v.begin(), v.end()); int expect[4] = { 70, 80, 85, 90 }; for (int k = 0; k < 4; k++) 27 28 29 30 31 32 33 34 35 36 37 38 39 40 assert(v[k] == sort(destroyedOnes.begin(), destroyedOnes.end ()); int expectGone[4] = { 10, 15, 20, 30 }; for (int k = 0; k < 4; k++) assert(destroyedOnes [k] == expectGone[k]); 41 expect[k]); 42 43 44 45 46 47 Bint main() { test(); cout <« "Passed" << endl; 48 49 50 51 return 0; 52 53
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
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