When quadratic sorts use granules

Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightforward Mergesort is optimal, but has a linear space requirement. This paper explores the use of sorted granules built using Mergesort with bounded space requirement in order to increase the efficiency of an in-place stable quadratic sort.