n^2 is less than n^3 right?
But is 2 * n^2 + 100 less than n^3?
Depends on how big n is, right?
Big O notation just assumes that n is big enough to make the answer "yes."
A good implementation could check problem sizes beforehand and chose the algorithm accordingly.
What I don't agree with is that "big O only matters for big input sizes". Big is not really a well-defined term. The problem here is that "big" depends entirely on the algorithms. It might also be n > 10. There's nothing in the definition of the landau symbols that prevents that.
"The big O performance of an algorithm only matters for a sufficiently large value of n."
"Define a sufficiently large value of n."
"Large enough that the big O performance of the algorithm starts to matter more than the coefficients of n and constant time operations."
So yes, that could be 10 or 10 million depending on the nature of the problem, the constants and coefficients of the algorithm, the language, the hardware, etc etc. You could have an algorithm that takes factorial time but maybe you're only using it in a problem domain where n is always < 10 so you'll probably never notice or care that it's O(n!)
You kind of need to know what a function is. That's not hard to explain either. Let's say we have f(x) = y. If I already lost you here let me know.
We say f is of O(N) (and this is a notation, not a function) if there exists two numbers, n1 and c such that for every n>n1 f(x)<cx. An example:
f(x) = 5 x
I can pick c = 6, n1 = 1, it's clear that for every value > 1 6x > 5 x. I just proved this function is O(N).
Note that f(x) = 1,000,000 + 5*x is also O(N), I just need to pick a large enough c and n1.
f(x) = x^2
There no c and n1 that will make the statement above true. f is not O(N).
F1(n) = 1 second * n + 1 day = O(n)
F2(n) = 1 millisecond * n + 1 month = O(n)
F3(n) = 1 nanosecond * n ^ 2 + 1 millisecond = O(n^2)
For really big numbers both F1 and F2 are faster but at n = 100 F3 has a huge lead and for say n = 1 billion F3 beats F1 but not F2.