Author(s): Mirza Abdulla
The classical sorting techniques such as Selection Sort and Insertion sort have a poor worst case time performance of . However, these techniques can be useful for relatively small data sets. In this paper we look at the interesting case of applying the ideas of both techniques on a set of n elements. We show that it is possible to use both techniques together to produce a more efficient hybrid sorting algorithm. This hybrid algorithm runs in √ and therefore, improves the worst case time efficiency by a factor of √ . The asymptotic time performance of the hybrid algorithm is the same for the best, average and worst case scenarios