A Comparative Analysis of different Sorting algorithm- A survey

Abstract

Sorting refers to the arrangement of data in a particular manner. It can be in ascending or descending order. Sorting is important to optimize the data searching results at high level. There are number of sorting algorithms like bubble sort, selection sort, insertion sort etc. This research paper focus on five sorting algorithms i.e. Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort. And also give the performance analysis of these algorithms with respect to time complexity. Sorting algorithms are always an area of focus for a long time of which one is good to use and when. KEYWORDS: Algorithm, Sorting, Bubble sort, Insertion sort, Selection sort, Merge sort, Quick sort