Alternatives and similar repositories for powersort

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

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆198Updated last month
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆63Updated 6 years ago
• jwtowner / lug
  C++ embedded domain specific language for extended parsing expression grammars (PEGs)
  ☆83Updated 9 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆26Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated last month
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 3 weeks ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 8 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆108Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last week
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 7 years ago
• lemire / validateutf8-experiments
  Reproducible experimeents on UTF-8 validation using SIMD instructions
  ☆41Updated last year
• splatlab / iceberghashtable
  ☆66Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆136Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago