Differences between version 2 and revision by previous author of BigOhNotation.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 2 | Last edited on Monday, August 11, 2003 2:07:24 pm | by JohnMcPherson | Revert |
| Older page: | version 1 | Last edited on Monday, November 18, 2002 12:13:25 pm | by DanielLawson | Revert |
@@ -1,5 +1,5 @@
-BigOhNotation is a way of describing the cost of an algorithm
or block of code. It describes the element of the algorithm that, as it increases, has the largest effect upon the overall cost of the algorithm or equation.
+BigOhNotation is a way of describing the cost of an [Algorithm]
or block of code. It describes the element of the algorithm that, as it increases, has the largest effect upon the overall cost of the algorithm or equation.
A mathematical example would be:
5n^2 + 6n - 2
