A Survey, Discussion and Comparison of Sorting Algorithms by
(2014)Abstract
Sorting is a basic task in many types of computer applications. Especially when large amounts of data are to be sorted, efficiency becomes a major issue. There are many different sorting algorithms and even more ways in which they can be implemented. The efficiency of real implementations is often at least as important as the theoretical efficiency of the abstract algorithm. For example, Quicksort is well-known to perform very well in most practical situations, regardless of the fact that many other sorting algorithms have a better worst-case behaviour. The goal of this master thesis is to make a survey of sorting algorithms and discuss and compare the differences in both theory and practice. There are several features that interests in this thesis such as finding possible implementations of each algorithm and discuss their properties and administer considerable experiments in order to obtain empirical data about their practical efficiency in different situations. Finally we present the comparison of different sorting algorithms with their practical efficiency and conclude the theoretical findings and the knowledge gained from this study.
Description
CiteSeerX — A Survey, Discussion and Comparison of Sorting Algorithms by