Article,
Extracting Equations for Actual Execution Times of Some Frequently Used Sorting Algorithms.
IUP Journal of Computer Sciences, 3 (4): 30 - 36 (2009)
Abstract
Ten common sorting algorithms were implemented and executed on a computer with Intel Pentium-4 running the Microsoft Windows XP operating system. Best case and worst case analyses of the algorithms were performed for lists of 1,000 to 10,000 integers. An improved version of bubble sort algorithm and the recursive quick sort algorithm were the fastest in the best case and the worst case, respectively. Equations for the execution times were also extracted from this analysis. The results displayed the actual performance of the algorithms on the given platform. The results of this study can be used to predict the execution time of these algorithms for an input of arbitrary size. Moreover, the results can be used to compare the performances of new sorting algorithms with those of the existing ones. The study also shows that an algorithm whose execution time is bound by a loose asymptotic limit may run faster than an algorithm whose execution time is bound by a stricter asymptotic limit. Th
