Can we write pseudocode sorting algorithm based on quicksort but improve its efficiency with insertion sort where appropriate ?
