Essential things to remember from today's class (class 10, 21st September)

The binary chop search:

   How it works, as an abstract idea, as a metod you could use yourself, not
      necessarily as part of a program

   Why it is so fast, and just how fast it is

The complexity classes, the big-O notation

   An idea of how to work it out for a given algorithm design, why we only
      care about the highest power of N and ignore constants.

   What it really means to be logarithmic or linear