Abstract: In this study, we apply different software complexity measures to Insertion 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 with respect to Halstead’s Volume, Program Difficulty and Program Effort; Insertion sort is best programmed in Assembly language and worst programmed in Java.