Calculate the minimum value of a sorted array.

Array subclasses that remain continuously sorted on insert() or push() calls, featuring optimized includes() and indexOf()

Arrays kept sorted by a comparator with binary search, insert, insert-ignore and upsert.

Tiny, zero-dependency binary search and sorted-array operations (indexOf, includes, insert, remove) for JavaScript and TypeScript. Every result is a valid Array.splice() index — no bounds checks, no off-by-one. Equivalent to std::lower_bound / bisect_left

Get index of first value in sorted array.

Fast JavaScript array sorting by implementing Python's Timsort algorithm

Sorted Array - uses binary search for fast insertion / reading

Get index of last value in sorted array.

Binary searches rightmost value in sorted array.

an async self sorting array

generate nearly sorted array

Binary searches leftmost value in sorted array.

Binary searches closest value in sorted array.

Binary searches rightmost value in sorted array.

Search fast in a Sorted Array

A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.

2 functions that both sort an array of strings: one returns the first string in the sorted array, the other returns the last

Push items to an array at their correct sort-position

A simple npm package that provides a binary search function for a sorted array

Get index of value in sorted array.