Is your feature request related to a problem? Please describe.

Describe the solution you'd like
The solution is a complete implementation of the simple-sort algorithm.

Describe alternatives you've considered

Additional context
Simplesort is a non-stable in-place sorting method similar to selectionsort. Simplesort has a time overhead in O(n2) for an array of length n in Landau notation. Simplesort is a particularly simple algorithm.