Binary search

binary search and related utility functions

A sorted map, implemented as a 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.

🚅 Find the closest or exact value using binary search

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

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

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

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

Binary search

Binary search of javascript

binary search tree

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

A generalized binary search implementation in TypeScript

Asynchronous binary search, using promises.

A zero-dependency TypeScript library to work with binary search trees and arrays of any types, with a functional-programming and immutable approach.

Binary search tree

binary search tree & avl tree (self balancing tree) implementation in javascript

A consistent hashing ring with binary search

Basic binary search tree