C++: Create a dynamic array implementation of a set. Add the efficiency of each function to the documentation in the header file. Use test_set.cpp as your test program and set.h as your header.

set.h:

/************************************ This class models an unbounded mathematical set. */ #ifndef _SET_H #define _SET_H #include  #include  class set { public: typedef int value_type; typedef std::size_t size_type; static const size_type INITIAL_CAPACITY = 30; set(); // postcondition: empty set has been created set (const set& s); // postcondition: copy of s has been created ~set(); // postcondition: set has been destroyed with all resources being deallocated set& operator = (const set& s); // postcondition: current object has been assigned s // returned: copy of s void insert (const value_type& entry); // postcondition: entry is in the set void remove (const value_type& entry); // postcondition: entry is not in the set size_type size() const; // returned: number of elements in the set bool contains (const value_type& entry) const; // returned: whether entry is in the set friend set set_union (const set& s1, const set& s2); //returned: union of s1 & s2 friend set set_intersection (const set& s1, const set& s2); // returned: intersection of s1 & s2 friend set set_difference (const set& s1, const set& s2); // returned: difference of s1 - s2 friend bool is_subset (const set& s1, const set& s2); // returned: whether s1 is a subset of s2 friend bool operator == (const set& s1, const set& s2); // returned: whether s1 & s2 are equal friend std::ostream& operator << (std::ostream& output, const set& s); // postcondition: s has been displayed on output private: void resize (size_type new_capacity); // postcondition: capacity of set has been modified to new_capacity size_type find (const value_type& entry) const; // returned location of entry in the set if entry is in the set - used otherwise value_type* data; size_type used; size_type capacity; }; #endif 

test_set.cpp:

#include "set.h" #include  #include  int main () { set s; assert (!s.contains (7)); s.insert (7); assert (s.contains (7)); s.remove (7); assert (!s.contains (7)); set s1; s1.insert (4); s1.insert (5); s1.insert (-24); s1.insert (89); s1.insert (34); s1.insert (11); s1.insert (0); s1.insert (3); s1.insert (14); s1.insert (28); std::cout << s1 << std::endl; set s2; s2.insert (6); s2.insert (-5); s2.insert (-24); s2.insert (-89); s2.insert (34); s2.insert (-11); s2.insert (0); s2.insert (3); std::cout << s2 << std::endl; set s3 = set_union (s1, s2); assert (s3.contains (4)); assert (s3.contains (0)); assert (s3.contains (-5)); std::cout << s3 << std::endl; set s4 = set_intersection (s1, s2); assert (s4.contains (34)); assert (!s4.contains (4)); assert (!s4.contains (-5)); std::cout << s4 << std::endl; set s5 = set_difference (s1, s2); assert (s5.contains (4)); assert (!s5.contains (0)); assert (!s5.contains (-5)); std::cout << s5 << std::endl; assert (is_subset (s5, s1)); std::cout << "all tests passed" << std::endl; return 0; }