TY  - JOUR
T1  - On the Software Complexity Measures of Bubble Sort Algorithm
AU - , S.O. Olabiyisi AU - , O.A. Adewole 
JO  - Research Journal of Applied Sciences
VL  - 3
IS  - 1
SP  - 5
EP  - 9
PY  - 2008
DA  - 2001/08/19
SN  - 1815-932x
DO  - rjasci.2008.5.9
UR  - https://makhillpublications.co/view-article.php?doi=rjasci.2008.5.9
KW  - Software complexity
KW  -bubble sort
KW  -Halstead complexity measure
KW  -cyclomatic complexity measure
AB  - 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.
ER  -