Ok im one of those people that are just completely unable to pick up C++. Im forced to take this class and i have no prior programmin experience but at least theres only a few weeks left of this. Anyway, I just want help with this assingnment. I'm not lookin for anyone to do this for me i just want to be walkedthrough with this, cuz i will need to do somethin like this for the final. Here's the assingment verbatim and nobody needs to help me with the extra credit part i just need to get the base assinment done. Thanks.
The Base Assignment
Implement and thoroughly test a class named IVector that represents a
dynamic array of integers. It will have 3 private data members: int
capacity, int count, and int * items. The 'capacity' is the physical size
of the dynamic array (its actual number of elements). The 'count' is
the number of elements currently in use (indices 0, 1, ..., count-1).
The pointer 'items' points to the first element of the dynamic array,
which will be created by the operator 'new'.
Class IVector will have three constructors: 1) a default constructor
that creates an array of capacity = 2 and count = 0; 2) a constructor
with parameter int cap that creates an array of capacity = cap and count =
0; and 3) a copy constructor with parameter "const IVector & V" that
creates an array that is identical to IVector V.
Class IVector will have the following public member functions: 1) two
getters that return the capacity and the count of an IVector object; 2)
one declared "void Append( int item )" that adds 'item' to 'items' at
position 'count' and increments 'count' by one; 3) one declared "void
Insert( int index, int item ) "that adds 'item' to 'items' at position
'index' and increments 'count' by one; and one declared "void Delete(
int index )" that deletes the item at position 'index' and decrements
'count' by one.
Overload the operator '[ ]' to access elements of the vector by
The following extra credit items are optional. You can get a "100"
without doing them.
1) Add two private member functions declared "void Grow( )" and "void
Shrink( )". function Grow() doubles the capacity of the array 'items'
without losing any element values and function Shrink() halves the
capacity of the array 'items' without losing any element values. Call
Grow() whenever and wherever count == capacity and methods Append() or
Insert() have been called. Call Shrink() whenever and wherever count <=
capacity/4 and method Delete() has been called.
2) Overload the assignment operator '=' to let you write v2 = v1; to
copy vector v1 over v2, thus making v2 identical to v1. This, as
expected, will lose any data v2 originally held.