Differences between version 3 and previous revision of BigONotation.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Sunday, August 24, 2003 12:05:29 am | by SamJansen | Revert |
| Older page: | version 2 | Last edited on Saturday, August 23, 2003 11:59:34 pm | by SamJansen | Revert |
@@ -7,7 +7,7 @@
If you write a function that is O(n*n) it is probably going to be quite slow with a large input size. A really quick function would be O(1). This would be something that only ever executes the same amount of code, no matter the input size.
[BigONotation] is hardly the only way to describe the complexity of an algorithm, there is also little oh notation, theta notation and others. However, they are rarely, if ever, used. BigONotation is the standard way to describe how a function scales to its input size.
-AddToMe
+Also, see [An informal introduction to O(N) notation|http://www.perlmonks.org/index.pl?node_id=227909].
-In the meantime, see
[An informal introduction to O(N) notation|http://www.perlmonks.org/index.pl?node_id=227909
].
+''Someone might want to merge this and
[BigOhNotation
].''
