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.
  ☆66Updated 2 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆71Updated 9 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 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!
  ☆124Updated last year
• lwu / veb-tree
  A C++ implementation of cache-oblivious Van Emde Boas search trees
  ☆19Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• boostorg / mpi
  Boost.org mpi module
  ☆59Updated last month
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆122Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• boostorg / graph_parallel
  Boost.org graph_parallel module
  ☆28Updated last month
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆75Updated 4 years ago
• goldsborough / bloom-cpp
  A header-only bloom filter implementation in C++14.
  ☆13Updated 6 years ago
• tzlaine / flat_map
  flat_map standardization proposal
  ☆10Updated 2 years ago
• prakhar1989 / progress-cpp
  A flexible ASCII progress-bar for C++
  ☆109Updated 5 months ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• boostorg / sort
  Boost.Sort
  ☆52Updated last month
• r-lyeh-archived / trie
  Trie is a lightweight and simple autocompletion data structure written in C++11.
  ☆44Updated 9 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆131Updated 5 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 5 years ago
• asutton / cxx14-graph
  A C++ 14 implementation of graph data structures
  ☆36Updated 8 years ago
• laudrup / lz4_stream
  A C++ stream using LZ4 (de)compression
  ☆39Updated 3 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆112Updated last month
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• gary-funck / parallel-merge-sort
  Shared Memory, Message Passing, and Hybrid Merge Sort: UPC, OpenMP, MPI and Hybrid Implementations
  ☆14Updated 11 months ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year