<< o
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
DO ALL THIS IN THE CODE PROVIDED BELOW
- Add destructor
- Add copy constructor
- Overload the assignment operator
- Overload the << operator to display set
- Add elements in sorted way
- Make search (logn)
#include <iostream>
#include<set>
using namespace std;
#include<set>
using namespace std;
class Set{
private:
int* arr;
int count=0;
int capacity=10;
public:
Set(){
arr = new int[capacity];
};
void add(int);
bool search(int);
Set union_set(const Set& set2);
void display();
};
int main(){
Set set1;
Set set2;
set1.add(5); set1.add(3); set1.add(2); set1.add(4);
set2.add(7); set2.add(3); set2.add(8); set2.add(9);
Set set3 = set1+ set2;
cout << set3;
Set set1;
Set set2;
set1.add(5); set1.add(3); set1.add(2); set1.add(4);
set2.add(7); set2.add(3); set2.add(8); set2.add(9);
Set set3 = set1+ set2;
cout << set3;
//example of the set use from the std library. Set implemented using BST
set<int> myset;
set<int>::iterator it; // pointer to a node
set<int>::iterator it; // pointer to a node
// set some initial values:
myset.insert(30);
myset.insert(70);
myset.insert(90);
myset.insert(20);
myset.insert(10);
//it = myset.find(20);
//myset.erase(it);
//myset.erase(myset.find(40));
myset.insert(30);
myset.insert(70);
myset.insert(90);
myset.insert(20);
myset.insert(10);
//it = myset.find(20);
//myset.erase(it);
//myset.erase(myset.find(40));
std::cout << "myset contains:";
for (it = myset.begin(); it != myset.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
for (it = myset.begin(); it != myset.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
return 0;
}
void Set::add(int data){
if (count >= capacity){
//expend set
}
//expend set
}
if (!search(data)){
//Futute improvement: insert sorted - lots of shifting, so BST is more efficient
arr[count++] = data;
}
//Futute improvement: insert sorted - lots of shifting, so BST is more efficient
arr[count++] = data;
}
}
bool Set::search(int data){
bool Set::search(int data){
//Futute improvement: binary search but has to be sorted
for (int i = 0; i < count; i++){
if (arr[i] == data)
return true;
}
return false;
}
Set Set::union_set(const Set& set2){
Set newSet;
for (int i = 0; i < count; i++)
newSet.add(arr[i]);
for (int i = 0; i < set2.count; i++){
newSet.add(set2.arr[i]);
}
return newSet;
}
for (int i = 0; i < count; i++){
if (arr[i] == data)
return true;
}
return false;
}
Set Set::union_set(const Set& set2){
Set newSet;
for (int i = 0; i < count; i++)
newSet.add(arr[i]);
for (int i = 0; i < set2.count; i++){
newSet.add(set2.arr[i]);
}
return newSet;
}
void Set::display(){
for (int i = 0; i < count; i++)
{
cout << arr[i] << ' ';
}
cout << endl;
}
for (int i = 0; i < count; i++)
{
cout << arr[i] << ' ';
}
cout << endl;
}
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.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![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