Abstract:
There are many popular problems in different practical fields of computer science, record applications, Networks and Artificial intelligence. These basic operation and problems is sorting algorithm; the sorting problem has attracted a great deal of research. This research paper presents the different types of comparison Based sorting algorithms of data structure like insertion, selection, bubble, quick and merges. Each algorithm is solving to specific sorting problem in a different formats. This research provides a detailed study of how all the five algorithms work and their algorithm, advantage, disadvantage and then compares them on the basis of various parameters like time complexity and space complexity.
