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
  ☆45Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• 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
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 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…
  ☆112Updated 8 months ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 11 months 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
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆36Updated last year
• 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…
  ☆77Updated 4 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last week
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆55Updated last month
• darealshinji / vectorclass
  Mirror of Agner Fog's C++ vector class library
  ☆30Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 6 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 5 months ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 7 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆118Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• drbobbeaty / DKit
  C++ Library of Atomic and Lockless Data Structures
  ☆38Updated 5 years ago
• boostorg / sort
  Boost.Sort
  ☆53Updated 3 weeks ago