Implementation of smoothsort

[zerothi]

This sorting algorithm should be better than heap-sort for nearly-sorted arrays.

In cases where the array is partially sorted this may even be faster than quick-sort because there will be less moving of elements compared to quick-sort.