Alternatives and similar repositories for BlockQuicksort:

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

• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 2 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 2 months ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• boostorg / sort
  Boost.Sort
  ☆52Updated 3 weeks ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 7 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 2 months 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…
  ☆109Updated 3 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 4 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 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
  ☆53Updated last year
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• 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
• google / hashtable-benchmarks
  ☆105Updated last year
• marvinwilliams / multiqueue
  ☆17Updated 3 weeks ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated 10 months ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated last month
• sid1607 / avx2-merge-sort
  ☆17Updated 8 years ago