Homework 3.
Please do the following problems (Beginning on Page 196)
- R-4.8
- R-4.9
- R-4.13
- C-4.8
- C-4.14
- C-5.8 (P 248, please give C/C++, cobol, assembly, ... code)
- A dynamic vector is a array which can grow when storage space is exceeded, or shrink when the vector is only 1/4 full.
Define a class and give pseudocode for the implementation of a dynamic vector.
You need only be concerned with the functions
- Insert(position, element)
- PushBack(element)
- PopBack();
- Delete(position, element)