set basic operations class

#include "setOp.h"

setOp::setOp()
{
}


setOp::~setOp()
{
}

void setOp::print(vector<int> a){
    cout << "{";
    for (int i = 0; i < a.size()-1; i++){
        cout << a[i] << ", ";
    }
    cout << a[a.size()-1] << "}\n";
}

vector<int> setOp::Intersection(vector<int> a, vector<int> b){
    vector<int> r;
    for (int i = 0; i < a.size(); i++){
        for (int j = 0; j < b.size(); j++){
            if (a[i] == b[j]){
                r.push_back(a[i]);
            }
        }
    }
    return r;
}

vector<int> setOp::Union(vector<int> a, vector<int> b){
    vector<int> r;
    for (int i = 0; i < a.size(); i++){
        r.push_back(a[i]);
    }
    for (int i = 0; i < b.size(); i++){
        int j;
        for (j = 0; j < a.size(); j++){
            if (b[i] == a[j])
                break;
        }
        if (j == a.size())
            r.push_back(b[i]);
    }
    return r;
}

vector<int> setOp::Symmetric_difference(vector<int> a, vector<int> b){
    vector<int> r;
    for (int i = 0; i < b.size(); i++){
        int j;
        for (j = 0; j < a.size(); j++){
            if (b[i] == a[j])
                break;
        }
        if (j == a.size())
            r.push_back(b[i]);
    }
    for (int i = 0; i < a.size(); i++){
        int j;
        for (j = 0; j < b.size(); j++){
            if (a[i] == b[j])
                break;
        }
        if (j == b.size())
            r.push_back(a[i]);
    }
    return r;
}

vector<int> setOp::Relative_complement(vector<int> a, vector<int> b){
    vector<int> r;
    for (int i = 0; i < b.size(); i++){
        int j;
        for (j = 0; j < a.size(); j++){
            if (b[i] == a[j])
                break;
        }
        if (j == a.size())
            r.push_back(b[i]);
    }
    return r;
}