Comparing sorting algorithm complexity based on control flow structure

Abstract

The aim of this paper is to compare the complexity of three simple sort algorithm; selection sort algorithm, bubble sort algorithm, and insertion sort algorithm. The measurement of the complexity is based on control flow structure and time processing. The control flow structure is illustrated into flowgraph and measured by number of out-degree and number of in-degree. The algorithm is coded in C programming language. The sorting experiment uses four data sets: 100,000 random words, 50,000 random words, 100,000 random integer numbers, and 50,000 random integer numbers to measure the time processing. The result of the measurement explains that the bubble sort algorithm has the complexity more than others.