Comparative Study of Implementation Languages on Software Complexity Measures of Quick Sort Algorithm

In this study, we apply different software complexity measures to Quick 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 Quick sort has the least Halstead’s Volume, Program Difficulty and Program Effort when programmed in Assembly language.