Programming complexity

This is an old revision of this page, as edited by 220.237.41.195 (talk) at 14:44, 14 September 2007 (Big O Notation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 extent that when programmers leave, companies fail, if those companies have no one else who understands what the programmers have done. Researchers have performed a great deal of research in an attempt to develop metrics, which adequately capture the complexity and reduce complexity of the software.

In general terms the complexity of a program is the number of steps that it takes to solve a problem or solve an algorithm. A smaller complexity means less steps and a more efficient program. Efficiency is of dire importance to every Computer Scientist and Software Engineer - these professionals are often coding Millions of methods in the one program, imagine if they all had large Complexities!



See also