Vector and Set Implementation

Use a circular buffer for a Vector ?

Java's ArrayList uses a circular buffer implementation

More efficient implementation of Set ?

Code from our lab assignments

bool contains(Set* st, int val)
{
    for (int i = 0; i < st->size; i++)
    {
        if (st->data[i] == val)
        {
            return true;
        }
    }
    return false;
}

Ordered Set : Balanced TreeSet

Unordered Set: Hash Table

Further Reading

Introduction to Set – Data Structure and Algorithm Tutorials - GeeksforGeeksGeeksforGeeks