The preferred alternative to the approach in Exercise suggested in the text was to ignore all subsists with fewer than LOWER_BOUND elements, not splitting them further.
When execution of the quicksort algorithm terminates, simply sort the list using insertion sort. Modify qui cohort () to incorporate this modification.