The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Big-O Notation
Replies: 4   Last Post: Mar 18, 2002 8:36 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Jason Silverman

Posts: 6
Registered: 12/6/04
Big-O Notation
Posted: Mar 18, 2002 6:19 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hey everyone,

I've semi-confused about Big-O 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)


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?


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.