Improved Quick Sort Average Performance Time by Combining with Selection and Insertion Algorithms

In many real-world applications, sorting is a crucial data structure. Sorting algorithms are methods for rearranging a collection of unsorted items into a desired format or order. A lot of sorting algorithms are developed to enhance the time performance, space complexity, and correctness. Selection, insertion, and quick sort are the most common kinds of sorting algorithms, each one has advantages and disadvantages. The advantages of selection sort algorithm are that it provides simplicity and efficiency for sorting small data, whereas the efficiency is bad for large data. On the other hand, the advantages of quick sort algorithm such that simplicity and efficiency for sorting small data, whereas its disadvantage is the overhead of recursive calling. To achieve the advantages of selection and insertion sorting algorithms, and overcome the drawback of quick sort, a merging of selection and quick sort, as well as a merging of insertion and quick sort, are proposed and analyzed and then compared to each other individually. This paper uses both theoretical and experimental data.