Big O notation O(n)

Can anyone explain the Big O(n) in finding the complexity of an algorithm?

Thanks in advance
Read about time complexity.

http://en.wikipedia.org/wiki/Time_complexity
Or maybe this site. It has many good comments and C/C++ code.
(http://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/)
@Stephen Davies: Both of your links don't work because they include the trailing parentheses as part of the address.
Last edited on
Ok thanks for your replies :)
Topic archived. No new replies allowed.