What is an easy way for finding C and N when proving the Big-Oh of an Algorithm?

Question

I\'m starting to learn about Big-Oh notation.

What is an easy way for finding C and N₀ for a given function?

Say, for example:

(n+1)⁵

Answer 1

It's going to depend greatly on the function you are considering. However, for a given class of functions, you may be able to come up with an algorithm.

For instance, polynomials: if you set C to any value greater than the leading coefficient of the polynomial, then you can solve for N₀.