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:
“With deep men, as with deep wells, it takes a long time for anything that falls into them to hit bottom. Onlookers, who almost never wait long enough, readily suppose that such men are callous and unresponsive—or even boring.”
—Friedrich Nietzsche (1844–1900)