You are here: irt.org | FOLDOC | time complexity

<*complexity*> The way in which the number of steps required by
an algorithm varies with the size of the problem it is
solving. Time complexity is normally expressed as an order of
magnitude, e.g. O(N^2) means that if the size of the problem
(N) doubles then the algorithm will take four times as many
steps to complete.

See also computational complexity, space complexity.

(1996-05-08)

Nearby terms: TILE Forth « Tim Berners-Lee « time bomb « **time complexity** » Time Complex Simulator » time division multiple access » time division multiplexing

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL