There is a particular arithmetic series that shows up time and time again in analysis of naïve implementations of many common programming challenges.
In this lesson we show why the time complexity is Quadratic, so you don't have to keep analyzing it over and over.