This research paper presents the different types of sorting algorithms of data structure like quick, heap, insertion and merges and also gives their performance analysis with respect to time complexity. These four algorithms have been an area of focus for a long time but still the question remains the same of “which to use when?” which is the main reason to perform this research. This research provides a detailed study of how all the four algorithms work and then compares them on the basis of various parameters apart from time complexity to reach our conclusion.
Quick sort, Heap sort, Insertion sort, Merge sort, time complexity, other performance parameters
International Journal of Trend in Scientific Research and Development - IJTSRD having
online ISSN 2456-6470. IJTSRD is a leading Open Access, Peer-Reviewed International
Journal which provides rapid publication of your research articles and aims to promote
the theory and practice along with knowledge sharing between researchers, developers,
engineers, students, and practitioners working in and around the world in many areas
like Sciences, Technology, Innovation, Engineering, Agriculture, Management and
many more and it is recommended by all Universities, review articles and short communications
in all subjects. IJTSRD running an International Journal who are proving quality
publication of peer reviewed and refereed international journals from diverse fields
that emphasizes new research, development and their applications. IJTSRD provides
an online access to exchange your research work, technical notes & surveying results
among professionals throughout the world in e-journals. IJTSRD is a fastest growing
and dynamic professional organization. The aim of this organization is to provide
access not only to world class research resources, but through its professionals
aim to bring in a significant transformation in the real of open access journals
and online publishing.