Subquadratic time

From Free net encyclopedia

Revision as of 05:48, 15 April 2006; view current revision
←Older revision | Newer revision→

Template:Cleanup-date

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)

Image:E-to-the-i-pi.svg This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://www.netipedia.com/index.php/Subquadratic_time"