Programming complexity
 | It has been suggested that this article be merged into Software metric and Talk:Software metric. (Discuss) Proposed since June 2008. |
 |
Programming Complexity is the complexity of programs, programming and languages, and one of the unsolved problems in software engineering.
Applications are complex to the extent 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 establish metrics which measure the complexity and can be used to figure out how to reduce the complexity of the software.
There are several metrics one can use to measure programming complexity:
- data complexity (Chapin Metric)
- data flow complexity (Elshof Metric)
- data access complexity (Card Metric)
- interface complexity (Henry Metric)
- control flow complexity (McCabe Metric)
- decisional complexity (McClure Metric)
- branching complexity (Sneed Metric)
- language complexity (Halstead Metric)
- cyclomatic complexity
See also
- Software crisis (and subsequent programming paradigm solutions)
- Software metrics - quantitative measure of some property of a program.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |