binary-search alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view binary-search alternatives based on common mentions on social networks and blogs.

arithmoi

9.5 0.0 binary-search VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences
build

9.5 0.0 binary-search VS build

Build Systems à la Carte

Access the most powerful time series database as a service

Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.

Promo www.influxdata.com

toysolver

9.3 0.0 binary-search VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

8.9 0.0 binary-search VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.8 0.0 binary-search VS iproute

IP Routing Table in Haskell
aeson-diff

8.5 0.0 binary-search VS aeson-diff

Generate and apply diffs between JSON documents.
graphs

8.3 0.0 binary-search VS graphs

a monadic graph library
funsat

8.2 0.0 binary-search VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
primes

8.2 0.0 binary-search VS primes

Prime Numbers for Haskell
union-find

7.9 0.0 binary-search VS union-find

Efficient union and equivalence testing of sets.
HMM

7.9 0.0 binary-search VS HMM

hidden markov models in haskell
presburger

7.8 0.0 binary-search VS presburger

Decision procedures for Presburger arithmetic in Haskell
imj-animation

7.8 2.5 binary-search VS imj-animation

Monorepo for a multi-player game engine, and game examples
text-metrics

7.6 0.0 binary-search VS text-metrics

Calculate various string metrics efficiently in Haskell
search-algorithms

7.5 0.0 binary-search VS search-algorithms

Haskell library containing common graph search algorithms
lca

7.4 0.0 binary-search VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
ADPfusion

7.3 0.0 binary-search VS ADPfusion

Efficient, high-level dynamic programming
Adaptive

6.9 0.0 binary-search VS Adaptive

Library for incremental computing.
dtw

6.6 0.0 binary-search VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.5 0.0 binary-search VS edit-distance

Edit distance library for Haskell
qchas

6.3 0.0 binary-search VS qchas

A library for implementing Quantum Algorithms
treeviz

6.3 0.0 binary-search VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
ListTree

6.2 0.0 binary-search VS ListTree

A List monad transformer and related tools
incremental-sat-solver

6.2 0.0 binary-search VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
integer-logarithms

6.0 0.0 binary-search VS integer-logarithms

Integer logarithms, originally split from arithmoi package
twentyseven

5.4 0.0 binary-search VS twentyseven

Rubik's cube solver in Haskell
cmaes

5.4 0.0 L1 binary-search VS cmaes

CMA-ES wrapper in Haskell
sgd

5.3 0.0 binary-search VS sgd

Stochastic gradient descent Haskell library
GraphSCC

5.2 0.0 binary-search VS GraphSCC

Tarjan's algorithm for computing strongly connected components
nonlinear-optimization-ad

4.8 0.0 binary-search VS nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with ad and backprop packages
DP

4.8 0.0 binary-search VS DP

Holder for a bunch of semirings used in ChartParsing
TrieMap

4.6 0.0 binary-search VS TrieMap

Generalized tries for Haskell
edit-distance-vector

4.4 0.0 binary-search VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
KMP

4.4 0.0 binary-search VS KMP

Knuth–Morris–Pratt string searching algorithm
union-find-array

4.4 0.0 binary-search VS union-find-array

ST based union find data structure
infinite-search

4.4 0.0 binary-search VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
primal

4.1 0.0 binary-search VS primal

Primitive World of Haskell
graph-generators

4.1 0.0 binary-search VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
adp-multi

4.1 0.0 binary-search VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
jps

3.9 0.0 binary-search VS jps

:point_right: jump point search for Haskell
primesieve

3.9 1.1 binary-search VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
spacefill

3.7 0.0 binary-search VS spacefill

Space-filling curves
pathfinding

3.7 0.0 binary-search VS pathfinding

Haskell pathfinding library
pell

3.4 0.0 binary-search VS pell

Haskell Package to solve the Generalized Pell Equation
epanet-haskell

3.1 0.0 L2 binary-search VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
MIP

3.1 0.0 binary-search VS MIP

Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell
edit-distance-linear

3.0 0.0 binary-search VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
stable-marriage

2.8 0.0 binary-search VS stable-marriage

library around stable marriage algorithms
primes-type

2.8 0.0 binary-search VS primes-type

Type-safe prime numbers.
fibonacci

2.8 0.0 binary-search VS fibonacci

Fast computation of Fibonacci numbers in Haskell