merge-insertion-sort.core — decidedlyso/merge-insertion-sort 1.0.2

binary-insert clj/s

(binary-insert n coll)

(binary-insert comp n coll)

Returns a new collection with n inserted into sorted coll so as to keep it sorted. If comp not provided, uses compare.

binary-search-insertion-point clj/s

(binary-search-insertion-point n coll)

(binary-search-insertion-point comp n coll)

(binary-search-insertion-point comp n lower-bound upper-bound coll)

Return the index at which to insert n into sorted coll, using binary search. If comp not provided, uses compare.

fn->comparator clj/s

(fn->comparator f)

Given a fn that might be boolean valued or a comparator, return a fn that is a comparator.

insert clj/s

(insert coll n i)

Returns a new collection with n inserted at index i into coll.

jacobsthal clj/s

(jacobsthal n)

Return the nth Jacobsthal number (0-indexed)

pending-element-order clj/s

(pending-element-order n)

Indexes to insert bs at, given n to insert (0-indexed)

sort clj/s

(sort coll)

(sort comp coll)

Returns a sorted sequence of the items in coll, using the merge-insertion sorting algorithm.
If comp not provided, uses compare.