DESIGN AND IMPLEMENTATION OF AN EFFICIENT SORTING ALGORITHM

Abstract

A Sorting Algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical orders and lexicographical orders. There are two basic requirements that a sorting algorithm must fulfill, the first one is that the output should be any permutation or reordering of the input and the second is that all the elements in the output should be in the desired order, which is increasing or decreasing. Sorting is of significant importance as we live in a world obsessed in keeping information. In order to efficiently search for required information we must keep that information in a sensible (logically appealing) order. So for our convenience computers spend a considerable amount of time on keeping data in order. Basically sorting is the rearranging of given items on the basis of some well defined ordering rules. From the very start of computer science the sorting problem, due to its immense usefulness, has invited the interest of researchers. The aim is to reduce the cost and complexity of the algorithm and to make them achieve efficiency levels untouched in the past. In the thesis, a new sorting method has been proposed, its algorithm has been derived and performance has been compared with well known existing methods. It was discovered that the algorithm proposed in this thesis is relatively simpler and efficient.