So 2^n would be exponential. However, n^2 is instead quadratic.
Quadratic time complexity is better than exponential.
Here is a useful comparison of the rate of growth for various time complexities[0]
O(n^[number]) = polynomial, with O(n^2) being quadratic.
O([a number]^n) = exponential.
I guess the authors aren't big on CS fundamentals?
Yes we all know the technical definitions with respect to software and algorithmic complexity. But the lack of sympathy/empathy on display with how a common definition of a word can be misconstrued by someone without an academic background in tech is kind of surprising (ok well maybe not so surprising but c'mon folks, we are all human)
https://en.wikipedia.org/wiki/Basic_reproduction_number#Esti...