MyLinkedList: MyLinkedList should have all of the functions from MyVector v1, but must store data in a linked list rather than an array.

Question

For this assignment, you will re-implement MyVector as a class called MyLinkedList. MyLinkedList should have all of the functions from MyVector v1, but must store data in a linked list rather than an array.

You also must implement a copy constructor -- a constructor that takes a reference to another MyLinkedList as a parameter, and produces a new MyLinkedList with the same contents as the original. 

You must also implement the following overloaded operators:

operator<< 

operator[]

Note that implementing a full linked list can be tricky! Insertion and deletion from the middle of a linked list can require thinking about a number of edge cases -- you will have to write functions that work when there's 0 items in the list, when there's 1 item in the list, and when there's many items in the list. I very, very, very strongly recommend drawing the list out on paper and thinking through the steps required to insert items, instead of just diving straight in to writing code. 

MyVector v1:

In this assignment you will create a class that partially reimplements the vector class from the C++ standard library. You must do the following;

 

Create a class called MyVector which stores ints in a dynamic array. MyVector should have three constructors:

1. a default constructor that creates a MyVector that can contain 10 ints, 
2. a one-parameter constructor that takes one int and creates a MyVector that can contain that number of ints
3. a two-parameter constructor that takes two ints. The first is used to determine the number of elements the MyVector can initially store, the second is used to initialize those values. (so MyVector(2, 3) creates a two-element array with both elements initialized to 3

MyVector should have the following member functions:

1. A function called grow which doubles the number of elements your MyVector can store. Call this function when your array needs to grow. This function should be private. 
2. A function called shrink which halves the number of elements your MyVector can store. Call this function if space for three times as many items are allocated as there are actual items in the MyVector. 
3. A function called pushBack which adds a new element to the end of the array
4. A function called popBack which returns the last element of the array and also removes it from the array.
5. A function called insert which takes two parameters -- an int to insert, and the index to insert it at. If the insertion is past the current end of the array, place it at the end of the array. Shift all elements past the insertion point to accommodate the new item.
6. A function called remove which takes one parameter (an index) and removes the element at that index. Shift all elements past the removal point down to avoid leaving gaps in your array
7. A function called at which takes an int as parameter and returns a reference to that index of the array. Print an error message and use exit(0) to end the program if the index is not in the array
8. Note: since it returns a reference, .at() can be used to both print values in the array and assign values to the array.
9. A destructor to delete [] the dynamic array when your MyVector goes out of scope.

You will almost certainly have to declare a number of private instance variables to implement this class.

Answer 1

This is the type of problem which is intended to assess your ability to translate high-level concepts such as vectors into language-level implementations. As tutors, it's not in our power to do that for you, but we can help you do that for yourself.

One of the first steps I use in this type of problem (a Class Implementation problem) is to list what kinds of attributes and methods the class should have. In other words, go through the definition of the class outlined in the assignment and take note of what is information that should be stored and what is functionality that should be allowed. Next, go through these notes and determine which of the items should be accessible to someone who declares a MyLinkedList object (what should be public) and which of the items should not be accessible to someone who declares a MyLinkedList object (what should be private).

After this, begin implementing each item that you've identified, implementing additional private methods and private variables as needed. If you run into issues, or you don't know how to continue (and if it's allowed by your instructor) consult C++ Documentation, of which there are multiple sources. I usually use C++ Reference, which is a very comprehensive, wiki-style source that describes in detail the features of C++ standards from C++98 to the present. In addition, keep in mind how you would test and debug this problem, either using a testing library like Boost C++ or some other library provided by your instructor, or by simultaneously writing a short, simple program that uses the class you've implemented.

In general, I would advise against posting problems verbatim from your courses. This is likely against academic policy and could get you in trouble with the organization that is providing your education. Instead, try out the problem on your own, and post questions when you run into problems, or ask about how to start solving problems if you're having trouble with getting started. That will not only allow you to improve your own ability to write code, it will also enable us to provide you with more thorough and specific assistance.