Research Journal of Applied Sciences
ISSN: Online 1993-6079ISSN: Print 1815-932x
Abstract
In this study, different software complexity measures are applied to Bubble sort algorithm. The intention is to study what kind of new information about the algorithm the complexity measures (Halstead’s volume and Cyclomatic number) are able to give and to study which software complexity measures are the most useful ones in algorithm comparison. The results explicitly show that Bubble sort has the least Halstead’s Volume and Program Difficulty when programmed in Assembly language and the least Program Effort when programmed in Java.
How to cite this article:
S.O. Olabiyisi and O.A. Adewole . On the Software Complexity Measures of Bubble Sort Algorithm.
DOI: https://doi.org/10.36478/rjasci.2008.5.9
URL: https://www.makhillpublications.co/view-article/1815-932x/rjasci.2008.5.9