Please write the code for the removeOdds function! Will thumbs up if correct!

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
icon
Related questions
Question

Please write the code for the removeOdds function! Will thumbs up if correct!

//a.Implement the removeodds function :
E#include <list>
#include <vector>
4
#include <algorithm>
#include <iostream>
#include <cassert>
using namespace std;
8.
9
B// Remove the odd integers from li. It is acceptable if the order
|// of the remaining even integers is notthe same as in the original list.
Evoid removeOdds (list<int>& li)
{
10
11
12
13
14
15
16
17
Evoid test()
{
int a[8] = { 2, 8, 5, 6, 7, 3, 4, 1 };
list<int> x(a, a + 8); // construct x from the array
assert(x.size()
removeodds (x);
assert(x.size()
vector<int> v(x.begin(), x.end ()); // construct v from x
sort(v.begin(), v.end());
int expect[4] = { 2, 4, 6, 8 };
for (int k = 0; k < 4; k++)
assert(v[k]
18
19
20
21
== 8 && x.front()
== 2 && x.back() == 1);
22
23
: 4);
==
24
25
26
27
28
expect[k]);
==
29
30
31
Bint main()
32
{
test();
cout <« "Passed" <« endl;
33
34
35
return 0;
36
- ----
Transcribed Image Text://a.Implement the removeodds function : E#include <list> #include <vector> 4 #include <algorithm> #include <iostream> #include <cassert> using namespace std; 8. 9 B// Remove the odd integers from li. It is acceptable if the order |// of the remaining even integers is notthe same as in the original list. Evoid removeOdds (list<int>& li) { 10 11 12 13 14 15 16 17 Evoid test() { int a[8] = { 2, 8, 5, 6, 7, 3, 4, 1 }; list<int> x(a, a + 8); // construct x from the array assert(x.size() removeodds (x); assert(x.size() vector<int> v(x.begin(), x.end ()); // construct v from x sort(v.begin(), v.end()); int expect[4] = { 2, 4, 6, 8 }; for (int k = 0; k < 4; k++) assert(v[k] 18 19 20 21 == 8 && x.front() == 2 && x.back() == 1); 22 23 : 4); == 24 25 26 27 28 expect[k]); == 29 30 31 Bint main() 32 { test(); cout <« "Passed" <« endl; 33 34 35 return 0; 36 - ----
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Data Binding
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education