Alternatives and similar repositories for SortingAlgorithmsBenchmark

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

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 7 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆41Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated 11 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆16Updated 2 months ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 7 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆39Updated 3 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 9 months ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆65Updated last month
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆78Updated 11 years ago
• lemire / counters
  performance counters in C++
  ☆22Updated 2 months ago
• boostorg / sort
  Boost.Sort
  ☆56Updated last week
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆58Updated last month
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• darealshinji / vectorclass
  Mirror of Agner Fog's C++ vector class library
  ☆30Updated 6 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…
  ☆78Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago