Chapter 6

1. When inserting a new element into the vector, it is placed at the already allocated free slot of the vector. If the size of the vector and its capacity are equal, this means that the vector has no free slot for the new element. In these (rare) cases, the vector automatically resizes itself, which involves allocating new memory space and copying the existing elements to that new bigger space.
2. When inserting an element at the front of the linked list, we only create the new element and update the list pointers to effectively place the new element in the list. Inserting a new element at the front of the vector requires all of the vector elements to be shifted right to free up a slot for that element.
3. Refer to the chapter source code in GitHub.
4. It will look like a linked list.
5. Selection sort searches for the maximum (or minimum) element and replaces the current one with...