This article relies largely or entirely on a single source. (November 2007) |
It has been suggested that Cyclomatic complexity be merged into this article. (Discuss) Proposed since November 2007. |
Programming Complexity is the complexity of programs, programming and languages, and one of the unsolved problems in software engineering.
Applications are complex to the extant that when programmers resign or are terminated, companies fail if those companies have no one capable of understanding what the programmers did [who?]. Because of this, researchers establishe metrics which measure the complexity and can be used to figure out how to reduce the complexity of the software.
One measure of the complexity of a program is the complexity of the algorithm, which is the number of steps to solve an algorithm or problem (see optimization problem).[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.
References
See also
- Software crisis (and subsequent programming paradigm solutions)
- Software metrics - quantitative measure of some property of a program.
- Analysis of algorithms
- Run-time analysis
- Computational complexity theory
 | This computer science article is a stub. You can help Wikipedia by expanding it. |