title: What is the upper bound of function f(n) = n in Big-O notation and why?
body: <p>I was reading the book Algorithm by Karumanchi .In one of the example it is given that for function f(n)= n the big-o notation is O(n^2).But why is that and why isn't it O(n) with c=2 and n0=1.</p>