Subquadratic time
From Wikipedia, the free encyclopedia
 |
This article or section may require cleanup to meet Wikipedia's quality standards. Please help improve this article or replace this tag with a more specific message. This article has been tagged since April 2006. (help, talk) |
An algorithm is said to run in subquadratic time if its running time f(n) is o(n2). Most naïve sorting algorithms are quadratic (e.g., insertion sort), but more advanced algorithms can be found that are subquadratic (e.g., merge sort). No general-purpose sorts run in linear time, but the change from quadratic to the common O(nlnn) is of great practical importance.
See also: Big O notation
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
