DataFrame.sort_values should have an algorithm with 'best' complexity for nearly sorted data
#### Problem description

I have got a large amount of data that is nearly sorted.
According to [these nice animations](https://www.toptal.com/developers/sorting-algorithms/nearly-sorted-initial-order), a simple insertion sort could be the fastest in this case.

So I suggest offering this as an additional algorithm for the 'kind' argument.
