Binary searches closest value in sorted array.

Binary searches leftmost value in sorted array.

Broad coverage of sorted array operations

Sorted array functionality

Implementation of insert, find and remove of sorted array

get contiguous ranges in pre-sorted array of numbers

Computes a quantile for sorted array of numbers

Simple function `binaryInsert(array, value, comparator)` that provides binary insert functionality for a **sorted** array in javascript. This is mostly intended for larger arrays, and the performance gain may be viewed in the [benchmark](#benchmarks).

permanent sorted array

Collection of cross-platform routines to operate effectively sorted arrays. For that ArraySorted provides customizable quicksort algorithm and a dozen functions to optimally find/add/remove single/multiple elements into a sorted array, add/remove sorted a

A TypeScript implementation of a sorted array with efficient insertion and search

Get index of value in sorted array.

A sorted array is a collection of values, arranged in an order {web}.

extremely fast JavaScript sorted array insertion

Sorted array with binary search — maintains order on insert

Easily generate a JSON or markdown list (sorted array) of property names of all enumerable properties, own and inherited, of objects that have function values.

Array with sorted insertion and optimized search methods.

Calculate the median value of a sorted array.

Calculate the maximum value of a sorted array.

Binary searches leftmost value in sorted array.