A COMPARATIVE STUDY OF VARIOUS TYPES OF SORTING TECHNIQUES
Pavleen Kaur · International Journal of Advanced Research in Computer Science · 2017
Sorting is the procedure of arranging the elements in ascending or descending order.Sorting algorithms are not only used in computer science but also in our day-to-day life to reduce complexity.For optimizing the use of other algorithms, efficient sorting is required.This paper makes a comparison between merge sort, quick sort, selection sort and insertion sort by their time complexities.