TITLE: Understanding big O notation
QUESTION [7 upvotes]: I'm not a mathematician by any stretch and I'm trying to translate some maths terms into simple maths terms. Please don't laugh, I do consider this complicated!
The equations in question are 
O(n) and O(n ^ 2)

Now, I have read up on Wiki about this but it has been written (IMO) for people who already understand it!
I believe n ^ 2 translates to the power of, in this case it is also the equivalent of squaring it (i.e. n * n).
However, I can't get my head around O in terms of what it is describing. Wiki says it's the limiting behaviour. So, does this mean O is more of a description than a function or command? In my understanding, the following 2 equations are the same
O(n^2)

n^2

REPLY [5 votes]: The formally correct $O$-notation has been explained in http://www.artofproblemsolving.com/Forum/viewtopic.php?f=296&t=31517&start=20 . Namely, suppose we have been given a positive $g$ defined in a punctured neighborhood of $x_0$. Now $O_{x_0}(g)$ is the class of all functions $f$ such that the ratio $f/g$ is bounded in some punctured neighbourhood of $x_0$. This definition and notation is more rigorous than for example the one given in some university's computer science courses.