• Vimal A.Vaiwala

An algorithm is accurately specified by a sequence of instructions to be carried out in order to solve a given problem. Sorting is considered by computer science as an intermediate step in many operations. Sorting is the process of putting a list of components in a specific order. According to their primary values, the elements are ordered in ascending or descending order. This study offers various data structure sorting algorithms, such as Bubble Sort, Selection Sort, Insertion Sort, Merge Sort and Quick Sort and also analyses how well they perform in terms of time complexity. These algorithms are crucial and have been a focus for a while, but the issue is remain the same of "which algorithm is use to when?" which is the important aspect for this study. This research paper gives an in-depth analysis of these algorithms workings and draws comparisons between them based on a number of different characteristics to reach solution.

Algorithm, Sorting, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Complexity

"An Analytical Study of Various Sorting Algorithms ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.3, Issue 9, page no.390-398, September-2016, Available :http://www.jetir.org/papers/JETIR1701A52.pdf

"An Analytical Study of Various Sorting Algorithms ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.3, Issue 9, page no. pp390-398, September-2016, Available at : http://www.jetir.org/papers/JETIR1701A52.pdf