This assignment extends your work on hw06 with linked lists, but also includes an extra focus on algorithmic complexity. The goals are as follows:

1. Learn how to keep data separate from containers
2. Practice designing algorithms and data structures
3. Practice using code that uses the following:
   1. linked lists
   2. structures for data encapsulation
   3. dynamic memory (i.e., malloc)
   4. struct initializer syntax (C99)
4. Learn how analyze the complexity of algorithms