Time Complexity - Sub-quadratic Time

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:

    “If Los Angeles is not the one authentic rectum of civilization, then I am no anatomist. Any time you want to go out again and burn it down, count me in.”
    —H.L. (Henry Lewis)