Binary Search for JavaScript
Binary searches leftmost value in sorted array.
Binary searches value in sorted array.
Binary searches closest value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches value in sorted array.
Binary searches closest value in sorted array.
Binary searches leftmost value in sorted array.
找到距离最近的值
Binary search for JavaScript; includes equality and proximity search methods
very simple number based binary search
A simple binary search I made as a snippet for leetcode tasks
CLI tool for performing web searches using Brave Search API
An ordering for sets of integers
Array module.
binary search
Binary search of javascript
Binary searches rightmost value in sorted array.
Extends Arrays with useful methods of unparalleled performance
Binary searches leftmost value in sorted array.
Binary searches leftmost value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches closest value in sorted array.
A code generation library for creating optimized Unicode property lookups
Misc algorithms implemented for embedded usage (i.e., wasm).
A high-quality Rust SDK for web search using DuckDuckGo, with content extraction capabilities
WebSearch tool for AI agent harnesses — declarative web search via a session-configured SearXNG backend, with SSRF defense, permission hook, result-count cap, and a discriminated result surface
High-performance Rust library and CLI tool for multi-provider web search. Supports Google, ArXiv, DuckDuckGo, Tavily AI, and more with aggregation strategies.
The binary search algorithm is extracted from Jon Bentley's # Programming Pearls 2nd ed. p.93
A binary search implementation in ruby
binary search for sorted text file. it is effective when file size is bigger.
A C implementation of the binary search algorithm for Ruby arrays.
Binary search extension for ActiveRecord.
This is an upgraded version of the excelent bsearch gem by Satoru Takabayashi. Tailored for Ruby 2.7+ mostly syntax changes.
== Description Proof of concept to maintain a file with sorted and unique values. This could be helpful for building building indexes. Range#bsearch is used to determine if a line is already in the file and to determine where a line should be inserted. This means Ruby 2.0 is required.