Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.



BigO Notation
Posted:
Mar 18, 2002 6:19 AM


Hey everyone,
I've semiconfused about BigO notation. I understand all of the basics, how it works, how to figure it out..or so I thought.
Two examples that were given in a computer programming book were actual functions and these I didn't understand.
1 + 2 + ... + n = O(n^2)
and
1^k + 2 ^ k + ... + n^ k = O(n^k+1)
Now from the actual programming sort/search examples and the other function examples they gave I would think the answer would be O(n) and O(n^k), respectfully, not what they have given.
Anyone know what I'm missing? Does it have something to do with it being the sum of all the numbers?
Jason



