Ford-Johnson algorithm for JavaScript. See docs. Parent is @aureooms/js-sort.
import { fordjohnson } from "@aureooms/js-merge-insertion-sort" ; import { binarysearch } from "@aureooms/js-search" ; import { swap } from "@aureooms/js-array" ; const fj = fordjohnson( binarysearch ) ; const sort = (compare, a, i, j) => fj(compare, swap, a, i, j) ;