Currently, Hotspot does not have a way to do a stable sort. Insertion sort is an in-place and stable sort, and it is the ideal algorithm for sorting arrays with a small number of elements. As a result, this issue proposes adding an insertion sort implementation.