Understanding what is meant by “the big O”, O(n^2) or “order of n-squared” and O(n log n) are key in digging into algorithms.
Here’s a nicely written and understandable tutorial:
http://www.crsr.net/Notes/BigO.html
If you’re like me and didn’t (or don’t) know what log stands for, it’s Logarithm.