4 packages tagged with “binary-search”
A number of helpful collections, such as a DropOffStack, a PriorityQueue, some binary-search types that allow chop-searching on virtual collections (not just on an array), and a grab-bag of additional types such as: A ConcurrentTasksRunner, a GuidTimeStamp, a Colour type, and so forth.
A high-performance .NET range query library for general numeric ranges.
High-performance postal code geolocation library with complete US and Canadian postal code database (41,000+ locations) using GeoNames data and binary search optimization. Features automatic country detection!
The KarateChop class provides a method for performing a binary search on a sorted array of integers. The main method, Chop, takes an integer target and an array of integers as parameters. It searches for the target within the array using a binary search algorithm. If the target is found, the method returns the index of the target in the array. If the target is not found, the method returns -1. This efficient search method has a logarithmic time complexity, making it suitable for large datasets.