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:
“Every time an ashtray is missing from a hotel, they don’t come looking for you. But let a diamond bracelet disappear in France and they shout John Robie, the Cat. You don’t have to spend every day of your life proving your honesty, but I do.”
—John Michael Hayes (b.1919)