Alternatives and similar repositories for quicksort-blog-post

Users that are interested in quicksort-blog-post are comparing it to the libraries listed below

• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• andralex / lomuto
  Code that accompanies the article "Lomuto's Comeback"
  ☆35Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 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
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆48Updated 10 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 years ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 5 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated 2 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• zwegner / x86-info-term
  A terminal viewer for x86 instruction/intrinsic information using Python 3 + curses
  ☆129Updated 2 years ago
• jeremycw / corc
  Stackless coroutine compiler for C
  ☆46Updated 5 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆31Updated last year
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated last year