#include <iostream>
using namespace std;

class SetArray
{
	//1. encapsulate
	private:
		int *ARRAY;
		int count;
		int capacity;

		//helper functions

		bool isFull()
		{
			return (capacity == count);
		}

		bool isEmpty()
		{
			return (count==0);
		}

		void doubleTheSize()
		{
			int newcap = capacity * 2;

			int *NEWARRAY = new int[newcap];

			for (int i=0; i < count; i++)
				NEWARRAY[i] = ARRAY[i];

			ARRAY = NEWARRAY;
			capacity = newcap;

			NEWARRAY = NULL;
		}

	public:
		int getCount() {
			return count;
		}

		int getCapacity() {
			return capacity;
		}

		int *getArray(){
			return ARRAY;
		}

		int cardinality() {
			return getCount();
		}
		// constructor
		SetArray()
		{
			count = 0;
			capacity = 3;

			ARRAY = new int[capacity];
		}
		bool exists(int item)
		{
			for (int i=i; i < count; i++)
			{
				if (ARRAY[i] == item)
					return true;
			}
			return false;
		}
		void add(int item)
		{
			if (!isFull())
				if (!exists(item))
					ARRAY[count++] = item;
				else
					cout << "Item " << item << " already exists...\n";
			else
			{
				doubleTheSize();
				add(item);
			}
		}

		void display()
		{
			cout << "S[";
			for (int i = 0; i < count; i++)
				cout << ARRAY[i] << (i < count-1 ? ", " : "");
			cout << "]\n";
		}

		friend ostream& operator<<(ostream& os, SetArray& sa)
		{
			os << "S[";
			for (int i = 0; i < sa.getCount(); i++)
				cout << sa.getArray()[i] << (i < sa.getCount()-1 ? ", " : "");
			cout << "]\n";
		}

		//operations

		SetArray unions(SetArray *as)
		{
			SetArray temp;

			for (int i=0; i < getCount(); i++)
				temp.add(getArray()[i]);

			for (int i=0; i < as->getCount(); i++)
				temp.add(as->getArray()[i]);

			return temp;
		}

		SetArray intersection(SetArray *as)
		{
			SetArray temp;

			for (int i=0; i < getCount(); i++)
				if (as->exists(getArray()[i]))
					temp.add(getArray()[i]);
			return temp;
		}


};

int main(int argc, char** argv) {

	SetArray sa, sb, sc, sd;

	sa.add(5);
	sa.add(75);
	sa.add(6);
	sa.add(100);

	sb.add(8);
	sb.add(12);
	sb.add(5);

	cout << sa;
	cout << sb;

	cout << "Union = " ;
	sc = sa.unions(&sb);

	cout << sc;
	cout << "Intersection = " ;
	sd = sa.intersection(&sb);

	cout << sd;

	return 0;
}