time complexity


time complexity

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

See also computational complexity, space complexity.