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:
“I came along at a time when there was a demand to give men greater visibility and opportunity. In white society they were saying, “Women can’t do it.” In black society, they were saying, “Women do too much.” It’s a diabolical situation.”
—Yvonne Braithwaite Burke (b. 1932)