Comparison of Software Complexity Metrics

  • Khan,et al. A
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the main problems in software engineering is the inherent complexity. Complexity metric is used to estimate various parameters such as software development cost, amount of time needed for implementation and number of tests required. In this paper, different software complexity models are critically studied and compared. For application, quick sort algorithm is considered. The programs are written in three object oriented languages: C++, Visual Basic and Java. Software complexity for each program is found using the four popular LOC, McCabe, Halstead and Cognitive models. The results are compared.

Cite

CITATION STYLE

APA

Khan,et al., A. A. (2016). Comparison of Software Complexity Metrics. International Journal of Computing and Network Technology, 4(1), 19–26. https://doi.org/10.12785/ijcnt/040103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free