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:
“The true charm of pedestrianism does not lie in the walking, or in the scenery, but in the talking. The walking is good to time the movement of the tongue by, and to keep the blood and the brain stirred up and active; the scenery and the woodsy smells are good to bear in upon a man an unconscious and unobtrusive charm and solace to eye and soul and sense; but the supreme pleasure comes from the talk.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)