Implement a vector-like data structure from scratch.
This question was to be done in C or C++.
1. Dealing with out of bounds accesses.
2. What happens when you need to increase the vector’s size?
3. How many copies does the structure perform to insert n elements? That is, n calls to vector.push_back
[advanced_iframe securitykey=”undefined” src=”https://code.kodnest.com/” width=”100%” height=”600″]