Why is 2n^2 = O(n^3) ?
This is given as an example of big O notation in the MIT OCW Introduction to Algorithms (SMA 5503) course. It's in lecture 2 around minute 3.
My calc background is extremely shaky, and I really don't understand what's going on there.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

It is O(n^2)

hmm. Then the professor must've made a mistake. Thanks!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.