Questions

1. Describe the insertion of an element into a dynamically growing vector.
2. What's the difference between inserting an element at the front of a linked list and at the front of a vector?
3. Implement a hybrid data structure that will store its elements in both a vector and a list. For each operation, choose the underlying data structure with the fastest implementation of the operation.
4. How would a binary search tree look if we insert 100 elements in increasing order?
5. What is the difference between the selection sort and insertion sort algorithms?
6. Implement the sorting algorithm described in the chapter, known as the counting sort.