Abstract: Sorting is an essential data structure operation, which performs easy searching, arranging and locating the information. I have deliberated about various sorting algorithms with their performance analysis to each other. I have also strained to show this why we have required another sorting algorithm; all sorting algorithm have some advantage and some disadvantage. This paper also illustrations how to find the running time of an algorithm with the help of C Sharp Programming language. I have compared five sorting algorithms (Heap Sort, Shell Sort, Bubble Sort, Merge Sort and Quick Sort) by performance analysis their running times calculated by a Program developing in C Sharp Language. I have analyze the performance of sorting algorithms by numerous essential factors, like complexity, memory, method, etc.

Keywords: Sorting, Heap Sort, Shell Sort, Bubble Sort, Merge Sort, Quick Sort, Stop Watch, Performance Analysis.