primitive-sort

This library provides a stable sorting algorithm for primitive arrays. When extra capabilities are available, the sort is parallelized. The algorithm currently uses mergesort on large chunks and switches to insertion sort on small chunks. The are also novel improvements to increase the performance if the input array is already mostly sorted.