// Computes the intersection of listl and list 2 and store it in result // Result must be sorted in ascending order and have no duplicates // Precondition: listi and list2 each are sorted in ascending order with no duplicates 11 result is an empty list // This must be done using NO list methods such add, sort, find, etc. These would lead to inefficient implementations void doIntersection (const list& list1, const list& list2, list& result) { result.clear(); list :: const iterator iterl; list :: const iterator iter2; iter1 list1.begin(); iter2 list2.begin(); while(iter1 = listl.end()){ result.push_back("iterl); } iteri++; while(iter2 = list2.end()) { result.push back( iter2);
// Computes the intersection of listl and list 2 and store it in result // Result must be sorted in ascending order and have no duplicates // Precondition: listi and list2 each are sorted in ascending order with no duplicates 11 result is an empty list // This must be done using NO list methods such add, sort, find, etc. These would lead to inefficient implementations void doIntersection (const list& list1, const list& list2, list& result) { result.clear(); list :: const iterator iterl; list :: const iterator iter2; iter1 list1.begin(); iter2 list2.begin(); while(iter1 = listl.end()){ result.push_back("iterl); } iteri++; while(iter2 = list2.end()) { result.push back( iter2);
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
Need to complete the intersection method. cant use the regular library and sort method.
Please type answer note write by hend.
![// Computes the intersection of listl and list 2 and store it in result
// Result must be sorted in ascending order and have no duplicates
// Precondition: list1 and list2 each are sorted in ascending order with no duplicates
11
result is an empty list
// This must be done using NO list methods such add, sort, find, etc. These would lead to inefficient implementations
void doIntersection (const list<int>& list1, const list<int>& list2, list<int>& result){
result.clear();
list <int> :: const iterator iterl;
list <int> :: const iterator iter2;
iteri list1.begin();
iter2 = list2.begin();
}
while(iter1 = listi.end()) {
result.push_back(*iterl);
}
iteri++;
while(iter2 1 list2.end()) {
result.push back(*iter2);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb9554b7c-22ae-4e76-970d-81082fa10344%2F9e48d073-178a-4833-83d2-05ec85fb7acc%2Fyxdripc_processed.jpeg&w=3840&q=75)
Transcribed Image Text:// Computes the intersection of listl and list 2 and store it in result
// Result must be sorted in ascending order and have no duplicates
// Precondition: list1 and list2 each are sorted in ascending order with no duplicates
11
result is an empty list
// This must be done using NO list methods such add, sort, find, etc. These would lead to inefficient implementations
void doIntersection (const list<int>& list1, const list<int>& list2, list<int>& result){
result.clear();
list <int> :: const iterator iterl;
list <int> :: const iterator iter2;
iteri list1.begin();
iter2 = list2.begin();
}
while(iter1 = listi.end()) {
result.push_back(*iterl);
}
iteri++;
while(iter2 1 list2.end()) {
result.push back(*iter2);
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education