binary search and related utility functions

Floating point binary search

[Fork of 'Louis Chatriot' version] Different binary search tree implementations, including a self-balancing one (AVL)

Range aka interval object. Supports exclusive and infinite ranges. Comes with an interval tree (augmented binary search tree).

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.

A consistent hashing ring with binary search

Binary search

Node.JS module that implements an optimized binary search over a given array of objects

Different binary search tree implementations, including a self-balancing one (AVL)

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

🚅 Find the closest or exact value using binary search

Binary Search Trees

A generalized binary search implementation in TypeScript

sorted sets with binary search

binary search function

Binary search algorithm

Binary search of javascript

A TypeScript implementation of binary search algorithm for browsers and Node.js

binary search tree

This consists of variations of several binary search functions used