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
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 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…
  ☆45Updated 4 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆51Updated 7 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆74Updated 3 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 3 years ago
• google / hashtable-benchmarks
  ☆105Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 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
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 4 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆67Updated last year