Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jambura Journal of Informatics
Olawale Debo Taofeek
University of Ilorin
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Halstead’s Complexity Measure of a Merge Sort and Modified Merge Sort Algorithms Ghaniyyat Bolanle Balogun; Muhideen Abdulraheem; Peter Ogirima Sadiku; Olawale Debo Taofeek; Adebisi Sodiq Adewale
Jambura Journal of Informatics VOL 5, NO 2: OCTOBER 2023
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jji.v5i2.21995

Abstract

Complexity measuring tools in computer science are deployed to measure and compare different characteristics of algorithms to find the best one to solve a particular problem or that suits a specific situation. Also,  this is used to measure the complexity of a software program without running the program itself. Given this, Halstead’s complexity metrics are deployed to compare the efficiency of two external sorting methods: the Merge Sort and the Modified Merge Sort Algorithms. The methodology used in achieving this lies in extracting operators and operands from the C_sharp (C#) implemented program of the two algorithms. Six Halstead metrics are evaluated using these operators and operands as parameters. The results show that the modified merge sort algorithm is much more efficient than the conventional Merge sort as it has a lower Program Volume, Program Difficulty, and Program Effort even though the advantage of a higher Intelligence content goes to the merge sort algorithm.
Co-Authors Adebisi Sodiq Adewale Ghaniyyat Bolanle Balogun Muhideen Abdulraheem Peter Ogirima Sadiku