Problem
I am struggling with algorithmic complexity and need some help with following questions:
A. What is the algorithmic complexity of expanding the memory allocated to a dynamically allocated array, assuming that you will need to copy over the values from the old array?
B. What is the algorithmic complexity of accessing an element in the middle of a dynamically allocated array?
C. What is the algorithmic complexity of expanding the memory allocated to a linked list, assuming that you already have a pointer to the location where you will insert the new node?