What is "Big O" and why does it matter?

Big O (pronounced "big-oh") is an asymptotic notation used to denote the time complexity of an algorithm. At the end of this blog, you should be able to understand what these terms mean: asymptotic analysis time complexity order of growth running tim...