OBJECT ORIENTED PROGRAMMING LANGUAGES FOR SEARCH ALGORITHMS IN SOFTWARE COMPLEXITY METRICS
Loading...
Date
2019-12-20
Journal Title
Journal ISSN
Volume Title
Publisher
International Research Journal of Computer Science (IRJCS)
Abstract
Complexity measures can be used to predict critical information about testability, reliability and
maintainability of the software systems from automatic analysis of the source code. In this paper different software
complexity metrics were applied to searching algorithms. Our intention is to match vigorous object oriented
applications (Visual Basic, C#, C++, Java and Python languages) of linear and binary search algorithms using
software complexity metrics such as (Line of Codes (LOC), McCabe cylomatic complexity metrics and Halstead
complexity metrics) and measured the sample program using LOC, McCabe method, the program difficulty using
Halstead method and degree of relationship using Pearson correlation Coefficient and Statistical Analysis of
Variance (ANOVA) for these three metrics. The five (5) languages correlate and do not differ significantly, then any
of the five (5) programming languages is good to code linear and binary search algorithms.
Description
Keywords
Citation
Sotonwa Kehinde A. Balogun Monsurat O., Isola Esther O., Olabiyisi Stephen O., Omidiora Elijah O., & Oyeleye Christopher A. (2019). Object Oriented Programming Languages for Search Algorithms in Software Complexity Metrics. International Research Journal of Computer Science (IRJCS), 4(6), 2393-9842.