Alternatives and similar repositories for quicksort-blog-post

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

• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 3 years ago
• 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
  ☆61Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 5 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆68Updated 4 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 5 months ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆68Updated last year
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆37Updated last year
• ConorStokes / LZSSE
  LZ77/LZSS designed for SSE based decompression
  ☆142Updated 6 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…
  ☆48Updated 4 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
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆123Updated 2 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated 7 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 10 months ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 4 years ago
• zwegner / x86-info-term
  A terminal viewer for x86 instruction/intrinsic information using Python 3 + curses
  ☆128Updated 2 years ago