Two Lists, Side by Side

We now have two classes with the same operations implemented in different ways. That means we can put the operations side by side and compare the costs.

Here is the time complexity of each operation:

Operation	`DynamicArray`	`LinkedList`
`add` (to end)	$O (1)$ amortized	$O (1)$
`get`	$O (1)$	$O (n)$
`set`	$O (1)$	$O (n)$
`size`	$O (1)$	$O (1)$
`indexOf`	$O (n)$	$O (n)$
`contains`	$O (n)$	$O (n)$
`remove(index)`	$O (n)$	$O (n)$
`remove(value)`	$O (n)$	$O (n)$

The array is faster on the get and set operations. The linked list is faster on the add operation, but only when the array has to resize.