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 first in time and the first in importance of the influences upon the mind is that of nature. Every day, the sun; and after sunset, night and her stars. Ever the winds blow; ever the grass grows.”
—Ralph Waldo Emerson (1803–1882)