USING SOFTWARE COMPLEXITY MEASURES TO ANALYSE ALGORITHMS — AN EXPERIMENT WITH HEAP SORT ALGORITHM

Abstract

In this paper, we apply different software complexity measures to Heap sort algorithm. Our 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 Heap sort has the least Halstead’s Volume, Program Difficulty and Program Effort when programmed in Pascal language and has the least cyclomatic number when programmed in Visual BASIC.