Binary search algorithm implementation in Javascript without any dependency
pure js binary search for sorted javascript arrays||array like objects. returns any || last || first || closest matched key for value, or slice between 2 values where values need not exist.
Binary search for Roblox
Get index of closest value in sorted array.
Binary search with comparator
Get index of closest value in sorted array.
Tiny, zero-dependency binary search 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.
A JavaScript emulator of the TreeSet Java class
Get index of value in sorted array.
Augmented Next Core - Utilities and Functions.
Get index of value in sorted array.
Get index of first value in sorted array.
Get index of first value in sorted array.
Binary search
An addon to node.js that provides a binary search function that runs in native C++.
Get index of last value in sorted array.
Scans from right, while a test passes.
Scans from right, until a test passes.
This library contains a set of utility functions to help implementing applications of libraries against Acoustic Content.
Scans from left, while a test passes.
TypeScript definitions for array-binarysearch.closest
Array#isArray for older browsers
A npm package that help you to use all famous ds and algo in your coding implementation
Scans from left, until a test passes.