Worksheet 4: Vector Bag Name:
An Active Learning Approach to Data Structures using C
1
Worksheet 4: Vector Bag, Vector Stack - Building new
Implementations using Existing Classes
One of the easiest ways to create a container is to leverage an existing data type
to build a new abstraction. In this lesson we will illustrate this process by building
a Bag and a Stack that will use a Vector to store its values.
As you learned in previous lessons, a Vector is an extensible data structure that
supports the following API:
struct vector;
void vectorInit (struct vector *);
void vectorFree (struct vector *);
void vectorAdd (struct vector *v, EleType d);
EleType vectorGet (struct vector *v, int index);
void vectorInsert (struct vector *v, int index, EleType newValue);
void vectorRemove (struct vector *v, int index);
EleType vectorSet (struct vector *v, int index, EleType newValue);
int vectorSize (struct vector *v);
Using a Vector as an underlying data container, implement a Bag. A Bag is
defined by the three operations: add, contains and remove. The add operation
we have already, so all you need to implement are the two remaining operations
contains and remove. The next page has the beginnings of this implementation.
int vectorContains (struct vector *v, EleType d);
void vectorRemove (struct vector *v, EleType d);
A stack requires the operations push (we can use add), pop and top.
void vector pop (struct vector *v);
EleType vectorTop (struct vector *v);
Based on your implementation, fill in the following table of algorithmic execution
times:
Operation
Execution time
add (struct vector *, Object value)
O(
contains (struct vector *, Object value)
O(
remove (struct vector *, Object value)
O(
Pop (struct vector *)
O(
Top (struct vector *);
O(
