Big-O computation

could anyone help me in the following question
Show that the function f(n) = 4n2 + 6n + 1 is O(n2) by finding the suitable values of c and n0

:confused:

Have a look at http://www.nist.gov/dads/HTML/bigOnotation.html for some information.

HD

thanks HairyDave for the site u gave me


it seems to be helpful but I couldn't get help

When using Big O notation, constants are eliminated, and as N get high N^2 becomes much more signifigant than just N...

For my prof all I would have to write is:

f(n) = 4n2 + 6n + 1
O(kn^2 + bn)
because as n becomes larger bn becomes more insignifigant
O(n^2)