complexity
(redirected from complexities)Also found in: Dictionary, Thesaurus, Medical.
complexity
[kəm′plek·səd·ē] (computer science)
The number of elementary operations used by a program or algorithm to accomplish a given task.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Complexity
Consisting of various parts united or connected together, formed by a combination of different elements; intricate, interconnecting parts that are not easily disentangled.
Illustrated Dictionary of Architecture Copyright © 2012, 2002, 1998 by The McGraw-Hill Companies, Inc. All rights reserved
complexity
(algorithm)The level in difficulty in solving mathematically
posed problems as measured by the time, number of steps or
arithmetic operations, or memory space required (called time
complexity, computational complexity, and space complexity,
respectively).
The interesting aspect is usually how complexity scales with the size of the input (the "scalability"), where the size of the input is described by some number N. Thus an algorithm may have computational complexity O(N^2) (of the order of the square of the size of the input), in which case if the input doubles in size, the computation will take four times as many steps. The ideal is a constant time algorithm (O(1)) or failing that, O(N).
See also NP-complete.
The interesting aspect is usually how complexity scales with the size of the input (the "scalability"), where the size of the input is described by some number N. Thus an algorithm may have computational complexity O(N^2) (of the order of the square of the size of the input), in which case if the input doubles in size, the computation will take four times as many steps. The ideal is a constant time algorithm (O(1)) or failing that, O(N).
See also NP-complete.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)