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
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated 11 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• boostorg / boost_unordered_benchmarks
  ☆17Updated 4 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• 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
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years 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
  ☆51Updated last year
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆54Updated 3 weeks ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 8 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated 2 months ago
• tpn / agner
  Collection of Agner Fog Software
  ☆38Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• darealshinji / vectorclass
  Mirror of Agner Fog's C++ vector class library
  ☆30Updated 5 years ago
• erenon / double_ended
  devector and batch_deque containers for C++. See more at: http://erenon.hu/double_ended
  ☆15Updated 7 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• brycelelbach / coroutines_ts_v1_experience
  Infomation about C++ Coroutines TS v1 software and content
  ☆9Updated 6 years ago
• google / hashtable-benchmarks
  ☆104Updated last year
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• InstLatx64 / AVX512_PopCnt
  AVX512 population count routines
  ☆22Updated 5 years ago