Simple maths behind Big-O

Isn’t it very common to hear about the worst-case time complexity of an algorithm? Well, let’s hear the math behind that! Let’s say we have two functions: f(x) and g(x). Big-O notation is a way to describe how fast functions grow, especially as x be...