Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

- Index
- » Coder's Corner
- »
**0(n)**

Pages: **1**

**LorraineBR****Member**- Registered: 2009-05-13
- Posts: 33

hey i was just wondering if any1 could give me a formal definition of f(n) is O(n) and what a graph illustrating it mite look like, its a question on a sample exam paper nd theirs no soloution for it

Theres only 10 type of people in the world

Those that understand binary

And those that dont

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 95,940

Hi Lorraine;

If you mean Landau's BIg Oh notation then this is straight definition stuff. Best way to deal with this type of problem is research.

go here:

http://en.wikipedia.org/wiki/Big_O_notation

You will now be able to draw a graph of some f(n) and its O(n)

When you understand that and if this is for computer science then go here for a discussion on its weaknesses:

http://leepoint.net/notes-java/algorithms/big-oh/bigoh.html

If you get past this you are ready for the Physicists. They are having an interesting discussion on Big Oh notation and computation of factorials. Careful though, some of it is not correct.

http://www.physicsforums.com/showthread.php?t=280854

Then comeback and you can explain it to me.

*Last edited by bobbym (2009-05-17 03:59:25)*

**In mathematics, you don't understand things. You just get used to them.**

**If it ain't broke, fix it until it is.**

Offline

Pages: **1**

- Index
- » Coder's Corner
- »
**0(n)**