It consists in evaluating the run-times of three well-known sorting algorithms: QuickSort, BubbleSort and InsertSort.
The empirical results show that the fastest sorting algorithm is Quicksort, followed by Insertsort, then by Bubblesort.
Keywords: sorting algorithm, complexity, QuickSort, BubbleSort, InsertSort
Like Quicksort, Bubblesort is widely used, but not necessarily because of its efficiency, having O(n2) theoretical time-complexity, but because of its simplicity.
For this research were chosen the most used three programming languages (Java, C ++ and C #) in which were implemented the following sorting algorithms: QucikSort, BubbleSort and direct insertion sort, in order to find out which programming language provides the shortest run-time.
Of the three sorting algorithms the most efficient one was QuickSort, followed by Direct insertion sort who earned an average run-time / array up to nine times higher in C #, eight times higher in C ++ and about three times higher in java, in comparison with QuickSort; on the last place is BubbleSort who earned an average run-time / array up to three times higher in C ++ and C # and 6 times higher in Java in comparison with Direct insertion sort.
Of the three programming languages, Java was the most efficient, obtaining for the BubbleSort algorithm an average run-time / array with up to two times lower in comparison with C ++ and up to four times lower in comparison with C#, for the Direct Insertion Sort algorithm an average run-time / array with up to four times lower in comparison with C ++ and up to eight times lower in comparison with C#, for the Quicksort algorithm an average run-time / array with approximately 1.
2] exchange methods, Bubblesort and Shakersort, and one n log n method, Quicksort [ILLUSTRATION FOR FIGURE 3 OMITTED].
This final fade out happens long before they are finished, since it would take another 54 minutes for Bubblesort to complete.