Essential things to remember from today's class (class 13, 3rd October)

How the templated accumumator did its job, and why one of its example uses
   reversed the list.

Make sure you could implement selection sort on a linked list for yourself
   without reference to your notes.

What O(...) means in terms of time and memory required for an algorithm.

What Constant, Linear, Quadratic, and Cubic mean in terms of that, why a
   Quadratic algorithm is always considered to be slower than a linear one.

How to quickly work out an algorithm's big-O in simple cases.