It is common for coders to jump straight into writing code, without thinking about the best way to do things. Algorithm complexity is just a way to formally measure how fast a program or algorithm runs.
It is important to be aware, at least partially, of different algorithm complexities so you don’t end up accidentally writing code that take 10 times longer than necessary. This talk is designed to introduce you to algorithm complexity analysis, and the big O (pronounced “big oh”) notation.