Alternatives and similar repositories for BlockQuicksort

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

• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆61Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• boostorg / sort
  Boost.Sort
  ☆53Updated 3 weeks ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆68Updated 4 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆75Updated 10 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last month
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 4 months ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆47Updated 4 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 6 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆128Updated 2 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆35Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 3 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• GorNishanov / coroutines-ts
  ☆21Updated 6 years ago