Sub-quadratic Time
An algorithm is said to be subquadratic time if T(n) = o(n2).
For example, most naïve comparison-based sorting algorithms are quadratic (e.g. insertion sort), but more advanced algorithms can be found that are subquadratic (e.g. Shell sort). No general-purpose sorts run in linear time, but the change from quadratic to sub-quadratic is of great practical importance.
Read more about this topic: Time Complexity
Famous quotes containing the word time:
“Time isn’t so important.... We can say that time is behind us, that we’ve had years together.... I can tell you about a thousand wonderful hours we’ve spent together because I feel we would have, inevitably. And there’s not that much difference between the future and the past.”
—Kurt Neumann (1906–1958)