// 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
icon
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);
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
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Structure
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
  • SEE MORE 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