Alternatives and similar repositories for SortingNetworks:

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

• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated 11 months 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
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆39Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆42Updated 11 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆121Updated 5 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆32Updated 8 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆69Updated 3 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆131Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆30Updated 6 years ago
• skarupke / mutex_benchmarks
  Code for benchmarking of mutexes to accompany a blog post of mine.
  ☆27Updated 5 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago