DEV Community

Discussion on: Big-O Notation from a Non-CS Perspective

lukaszahradnik profile image
Lukáš Zahradník

Hey, glad my feedback helped at least a little bit. It looks great.

Last time I missed this (maybe it is out of purpose of this article being less technical?):

A function with quadratic time complexity has a growth rate of n2. Meaning? If the input size is 2, then the function will take 4 operations

Functions n^2, n^2 + n, n^2 + 1 etc. are all in O(n^2) and only n^2 (for n=2) would result into 4 (operations). You have similar "issue" with exponential time and some other cases.

But I like the way you show those calculations as they give better idea how the number of operations grow.