Professor Good proposed a sorting algorithm that combines quicksort and insertion sort. The algorithm runs as quicksort when the number of elements is greater than $10,$ otherwise it uses insertion sort. Please argue whether this algorithm is better than quicksort alone or not. Justify your argument.