# A handwritten introduction to analysis of algorithms (1/2): asymptotic notations and examples

Jun 16 · 17 min read

This article is about asymptotic notations and how we use them to estimate the runtime complexity of an algorithm. We will start by introducing the mathematical concepts behind these notations. The rest of the article will give numerous examples of analysis of some well-known algorithms to cover a wide range of techniques

I will illustrate this article with code written in Go and F#, depending on what paradigm lends itself more to each function. I will try to make the…