Performance Evaluation of Some Selected Sorting Algorithms by the Use of Halstead Complexity Metrics

Journal Title: Transactions on Machine Learning and Artificial Intelligence - Year 2017, Vol 5, Issue 2

Abstract

Complexity is developed to demonstrate feasible metrics for process obtaining objectives and quantifiable measurement, which may have numerous valuable applications in schedule and budget planning, cost estimation and optimal personnel task assignments a particular software. Also it aids the developer and practitioners in evaluating the software complexity due to its simplicity, which serves both as an analyzer and as a predicator in quantitative software engineering. In this research work, the Halstead complexity metrics were applied to three sorting algorithms and C�]Sharp programming language was used to implement them. The results shows the variant performances of sorting algorithms and the best algorithm that can perform better in a defined system of application.

Authors and Affiliations

A. O Afolabi

Keywords

Related Articles

Cognitive Assessment Concern and Learning Outcomes of Selected Under-Graduate Students at MLRIT-Hyderabad

This study investigated the level of Cognitive Assessment Concern of selected undergraduate students. It also sought to find out whether CAC of students vary by ability (performance) levels and sex. A total of 246 purpos...

Comparison Performance Evaluation of Modified Genetic Algorithm and Modified Counter Propagation Network for Online Character recognition

This paper carries out performance evaluation of a Modified Genetic Algorithm (MGA) and Modified Counter Propagation Network (MCPN) Network for online character recognition. Two techniques were used to train the feature...

IoT Middleware Architecture based on Ontologies to Model Logistic Process

In recent years, the Internet of Things (IoT) become a promising topic of technical social and economic significance, especially with the high number of developed sensors and technologies. Logistic applications are a per...

Some Properties of Associates of Subsets of FSP-Points Set

In this paper, based upon Fs-set theory [1], we define a crisp Fs-points set FSP(..) for given Fs-set .. and establish a pair of relations between collection of all Fs-subsets of a given Fs-set .. and collection of all c...

Survey and Comparative Study on Agile Methods in Software Engineering

Today‘s business environment is very much dynamic, and organizations are constantly changing their software requirements to adjust with new environment. They also demand for fast delivery of software products as well as...

Download PDF file
  • EP ID EP275555
  • DOI 10.14738/tmlai.52.2793
  • Views 65
  • Downloads 0

How To Cite

A. O Afolabi (2017). Performance Evaluation of Some Selected Sorting Algorithms by the Use of Halstead Complexity Metrics. Transactions on Machine Learning and Artificial Intelligence, 5(2), 9-17. https://europub.co.uk/articles/-A-275555