algorithm - Time complexity of an+b = O(n^2)? -
I am reading "Introduction to Algorithms" and stuck on Chapter 3, where the authors say "What's more surprising It may be possible that when someone> 0, there is a linear function in a + b
o (n ^ 2) "Can anyone prove to prove this?
A linear function is a + b
O (n ^ 2)
By definition: Enough large N
, a + b
cn ^ 2
, for example C = 1
.
Note that O (n ^ 2)
is upper bound, but not tight