Selection of Best Sorting Algorithm for a Particular Problem

Abstract

Sorting is the fundamental operation in computer science. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. There are many sorting algorithms. All sorting algorithms are problem specific. The particular Algorithm one chooses depends on the properties of the data and operations one may perform on data. Accordingly, we will want to know the complexity of each algorithm; that is, to know the running time f (n) of each algorithm as a function of the number n of input elements and to analyses the space requirements of our algorithms. Selection of best sorting algorithm for a particular problem depends upon problem definition. Comparisons of sorting algorithms are based on different scenario. We are comparing sorting algorithm according to their complexity, method used like comparison-based or non-comparison based, internal sorting or external sorting and also describe the advantages and disadvantages. One can only predict a suitable sorting algorithm after analyses the particular problem i.e. the problem is of which type (small number, large number, repeated value)