# Write a Set class. The set has a dynamic array 'items' to store data. The set should satisfy the following properties: 1.No duplicate data in the set (duplicate data cannot be inserted into a set). 2.Only positive integers are stored in the set. 3.Cannot store more data than capacity. Use the following Set interface. You should write Set implementation and main function that shows all of your member functions work correctly.

Use C++

Write a Set class. The set has a dynamic array 'items' to store data. The set should satisfy the following properties:

1.No duplicate data in the set (duplicate data cannot be inserted into a set).

2.Only positive integers are stored in the set.

3.Cannot store more data than capacity.

Use the following Set interface. You should write Set implementation and main function that shows all of your member functions work correctly.

#ifndef SET_H

#define SET_H

#include <iostream>

using namespace std;

class Set

{

public:

Set(); // create a set with capacity 10

Set(int capacity); // create a set with capacity

Set(const Set& source); // copy constructor

~Set(); // destructor

void insert(int item); // insert item into the set

void remove(int item); // remove item from the set

bool full(); // return true, if set is full

bool exist(int item) const; // return true, if item is in the set

void operator +=(const Set& source);

void operator =(const Set& source);

void show () const; // show all elements of a set v

int getSize() const; // get size

int getCapacity() const; // get capacity

private:

int* items;

int size; // number of items in the array 'items'

int capacity;

};

// create a new set by adding two sets s1 and s2

Set operator +(const Set& s1, const Set& s2);

#endif

Step by step

Solved in 3 steps with 1 images