A simple and fast implementation of insertion sort
npm install sort-insertionReturns a sorted array, original array stays untouched.
js
import sort from 'sort-insertion'sort([6, 2, 5, 3], function (a, b) {
return a > b
}) // returns [2, 3, 5, 6]
sort(['hello', 'how', 'are', 'you', '?'], function (a, b) {
return a.length > b.length
}) // returns ['?', 'how', 'are', 'you', 'hello']
``