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
• boostorg / sort
  Boost.Sort
  ☆52Updated last month
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• 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
• 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
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆32Updated 8 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated this week
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated last year
• boostorg / proto
  Boost.org proto module
  ☆21Updated 2 months ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆126Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆112Updated 4 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 8 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 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
• tankiJong / cpp-coroutine-job-system
  Example Code for Cpp Coroutine Job System talk at CppCon 2020
  ☆40Updated 4 years ago
• neumannt / exceptionperformance
  performance experiments for C++ exception handling
  ☆30Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆131Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆69Updated 8 years ago