fibonacci alternatives and similar packages

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

• arithmoi

  9.5 0.0 fibonacci VS arithmoi

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

• build

  9.5 0.0 fibonacci VS build

  Build Systems à la Carte

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org



• toysolver

  9.3 0.0 fibonacci VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 0.0 fibonacci VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 0.0 fibonacci VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.5 0.0 fibonacci VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.3 0.0 fibonacci VS graphs

  a monadic graph library

• primes

  8.2 0.0 fibonacci VS primes

  Prime Numbers for Haskell

• funsat

  8.2 0.0 fibonacci VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• union-find

  8.0 0.0 fibonacci VS union-find

  Efficient union and equivalence testing of sets.

• presburger

  7.9 0.0 fibonacci VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• HMM

  7.9 0.0 fibonacci VS HMM

  hidden markov models in haskell

• imj-animation

  7.8 1.8 fibonacci VS imj-animation

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

• text-metrics

  7.6 0.0 fibonacci VS text-metrics

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.6 0.0 fibonacci VS search-algorithms

  Haskell library containing common graph search algorithms

• lca

  7.4 0.0 fibonacci 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 fibonacci VS ADPfusion

  Efficient, high-level dynamic programming

• Adaptive

  6.9 0.0 fibonacci VS Adaptive

  Library for incremental computing.

• dtw

  6.7 0.0 fibonacci VS dtw

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.5 0.0 fibonacci VS edit-distance

  Edit distance library for Haskell
  

• qchas

  6.2 0.0 fibonacci VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.2 0.0 fibonacci VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• ListTree

  6.2 0.0 fibonacci VS ListTree

  A List monad transformer and related tools

• integer-logarithms

  6.0 0.0 fibonacci VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• treeviz

  6.0 0.0 fibonacci VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• binary-search

  5.9 0.0 fibonacci VS binary-search

  Binary and exponential searches

• cmaes

  5.4 0.0 L1 fibonacci VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  5.4 0.0 fibonacci VS sgd

  Stochastic gradient descent Haskell library

• twentyseven

  5.2 0.0 fibonacci VS twentyseven

  Rubik's cube solver in Haskell

• nonlinear-optimization-ad

  4.9 0.0 fibonacci VS nonlinear-optimization-ad

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

• DP

  4.9 0.0 fibonacci VS DP

  Holder for a bunch of semirings used in ChartParsing

• GraphSCC

  4.7 0.0 fibonacci VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• TrieMap

  4.7 0.0 fibonacci VS TrieMap

  Generalized tries for Haskell

• infinite-search

  4.5 0.0 fibonacci VS infinite-search

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

• KMP

  4.5 0.0 fibonacci VS KMP

  Knuth–Morris–Pratt string searching algorithm

• union-find-array

  4.5 0.0 fibonacci VS union-find-array

  ST based union find data structure
  

• edit-distance-vector

  4.2 0.0 fibonacci VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• graph-generators

  4.2 0.0 fibonacci VS graph-generators

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

• primal

  4.2 0.0 fibonacci VS primal

  Primitive World of Haskell

• primesieve

  4.0 0.8 fibonacci VS primesieve

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

• jps

  4.0 0.0 fibonacci VS jps

  :point_right: jump point search for Haskell

• spacefill

  3.8 0.0 fibonacci VS spacefill

  Space-filling curves

• pathfinding

  3.7 0.0 fibonacci VS pathfinding

  Haskell pathfinding library

• adp-multi

  3.7 0.0 fibonacci VS adp-multi

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

• pell

  3.5 0.0 fibonacci VS pell

  Haskell Package to solve the Generalized Pell Equation

• epanet-haskell

  3.2 0.0 L2 fibonacci VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• edit-distance-linear

  3.1 0.0 fibonacci VS edit-distance-linear

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

• primes-type

  2.9 0.0 fibonacci VS primes-type

  Type-safe prime numbers.

• stable-marriage

  2.8 0.0 fibonacci VS stable-marriage

  library around stable marriage algorithms

• bordacount

  2.5 0.0 fibonacci VS bordacount

  Haskell implementation of the Borda count election method

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of fibonacci or a related project?

Access the most powerful time series database as a service sponsored www.influxdata.com

Popular Comparisons

• fibonacci
  vs
  pell
• fibonacci
  vs
  lca
• fibonacci
  vs
  binary-search
• fibonacci
  vs
  integer-logarithms
• fibonacci
  vs
  arithmoi

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com