We have been learning about algorithm complexity and big O notation in class recently. CSC148 has been covering the topic in a very practical way, for example how it applies to sorting algorithms. We are also covering it in CSC165, which has been going more rigorous into the theory behind it. Despite being kind of abstract, I think the idea of big O is really intuitive; the difficult part is actually applying it the code you write.
