Subquadratic time
From Free net encyclopedia
(Difference between revisions)
| Revision as of 05:48, 15 April 2006 Pearle (Talk | contribs) Changing {{attention}} to {{cleanup-date|April 2006}} ← Previous diff |
Current revision Pearle (Talk | contribs) Changing {{attention}} to {{cleanup-date|April 2006}} |
Current revision
An algorithm is said to run in subquadratic time if its running time <math>f(n)</math> is <math>o(n^2)</math> (more on Big O notation)
