Alternatives and similar repositories for fibonacci

Users that are interested in fibonacci are comparing it to the libraries listed below

• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆67Updated 2 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• r-lyeh-archived / trie
  Trie is a lightweight and simple autocompletion data structure written in C++11.
  ☆44Updated 10 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆128Updated 2 years ago
• boostorg / sort
  Boost.Sort
  ☆53Updated this week
• WojciechMula / simd-heap
  ☆10Updated 5 months ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆31Updated 6 years ago
• boostorg / dynamic_bitset
  Boost.org dynamic_bitset module
  ☆42Updated 2 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• asutton / cxx14-graph
  A C++ 14 implementation of graph data structures
  ☆34Updated 8 years ago
• lwu / veb-tree
  A C++ implementation of cache-oblivious Van Emde Boas search trees
  ☆19Updated 7 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• patflick / mxx
  C++11 Message Passing
  ☆74Updated 3 years ago
• agency-library / agency
  Execution primitives for C++
  ☆153Updated 5 years ago
• boostorg / mpi
  Boost.org mpi module
  ☆62Updated last month
• tzlaine / flat_map
  flat_map standardization proposal
  ☆10Updated 3 years ago
• lemire / counters
  performance counters in C++
  ☆21Updated 2 weeks ago
• weissan / BlockQuicksort
  ☆34Updated 3 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆90Updated 7 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• boostorg / iterator
  Boost.org iterator module
  ☆21Updated 2 weeks ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆74Updated 10 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• boostorg / ublas
  Boost.uBlas
  ☆116Updated 2 months ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆61Updated last year
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆65Updated 10 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago