Performance Comparison of Different Sorting Algorithms

Abstract— Sorting is the basic operation in most of the applications of computer science. Sorting means to arrange data in particular order inside computer. In this paper we have discussed performance of different sorting algorithms with their advantages and disadvantages. This paper also represents the application areas for different sorting algorithms. Main goal of this paper is to compare the performance of different sorting algorithms based on different parameters.

Keywords— Algorithm, Time Complexity, Space Complexity

I. INTRODUCTION

In computer application sorting is the process of arranging data in particular order. The process of sorting arranges numerical data in increasing or decreasing order and text data in alphabetical order. Now a day’s big issue is to handle large amount of data in computer and for that sorting is an essential task. Sorting improves the efficiency of searching particular data in computer. There are many techniques available for sorting. The selection of the particular sorting technique depends on type of data. A Sorting is an important and widely studied issue, where the execution time and the required resources for computation is of extreme importance, especially if it is dealing with real-time data processing. So it is essential to study and to compare its performance for all the available sorting algorithms. [1, 2, 4, 6] The importance of sorting lies in the fact that searching can be optimized to a very fast, if data is stored in a sorted manner. Sorting is also used to represent data in more readable formats. Following are some of the real life examples of sorting: Words in dictionary, File system in Directory, Book Index, Event calendar, Musical compact disks, Attendance sheet, etc. II. TYPES OF SORTING TECHNIQUES There are many categories for the sorting techniques. Depending upon the category of the algorithm we could analyze the sorting algorithm. [2] A. Internal and external sorting If sorting process is performed within main memory than it is referred as an internal sorting. If amount of data is so large that requires secondary memory for the soring process than it is referred as an external sorting. This technique is also referred as in-place sorting and not-in place sorting.
Read More

International Journal of Latest Technology in Engineering, Management & Applied Science (IJLTEMAS)