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
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.
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:
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.
Then comeback and you can explain it to me.
Last edited by bobbym (2009-05-17 03:59:25)
If it ain't broke, fix it until it is.
A number by itself is useful, but it is far more useful to know how accurate or certain that number is.