The complexity of most computer programs and programming languages is one of the unsolved problems in software engineering. The current applications are complex to the extant that when programmers leave, companies fail if those companies have no one to understand what the programmers did. Researchers strove to develop metrics which adequately capture the complexity and reduce complexity of the software.
One measure of the complexity of a program is the complexity of the algorithm, which is the number of steps that it takes to solve a problem or solve an algorithm.[1] A smaller complexity means less steps and a more efficient program. Efficiency and optimization are important to professional writers of software who often code millions of interconnected methods in one program, all with large complexities and analytic and organizational difficulty.
See also
 | This computer science article is a stub. You can help Wikipedia by expanding it. |