Alternatives and similar repositories for fluxsort

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

• scandum / blitsort
  Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
  ☆713Updated last year
• scandum / crumsort
  A branchless unstable quicksort / mergesort that is highly adaptive.
  ☆334Updated last year
• TheRealOrange / icer_compression
  Progressive, error tolerant, wavelet-based image compression algorithm
  ☆657Updated 2 months ago
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆358Updated 2 years ago
• avaneev / komihash
  Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 27GB/s + PRNG
  ☆261Updated last month
• skeeto / hash-prospector
  Automated integer hash function discovery
  ☆741Updated last year
• iczelia / bzip3
  A better and stronger spiritual successor to BZip2.
  ☆1,090Updated 3 months ago
• jk-jeon / dragonbox
  Reference implementation of Dragonbox in C++
  ☆783Updated last month
• orlp / glidesort
  A Rust implementation of Glidesort, my stable adaptive quicksort/mergesort hybrid sorting algorithm.
  ☆1,641Updated 2 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆162Updated 2 years ago
• Nicoshev / rapidhash
  Very fast, high quality, platform-independent hashing algorithm.
  ☆693Updated this week
• cotowali / cotowali
  A statically typed scripting language that transpile into POSIX sh
  ☆620Updated 10 months ago
• simdutf / simdutf
  Unicode routines (UTF8, UTF16, UTF32) and Base64: billions of characters per second using SSE2, AVX2, NEON, AVX-512, RISC-V Vector Extens…
  ☆1,569Updated last week
• clibraries / array-algorithms
  Unintrusive algorithms for C arrays OR a C implementation of <algorithm> from C++
  ☆213Updated 2 years ago
• avaneev / lzav
  Fast In-Memory Data Compression Algorithm (inline C/C++) 480+MB/s compress, 2800+MB/s decompress, ratio% better than LZ4, Snappy, and Zst…
  ☆465Updated last week
• tlack / atree
  Stevan Apter-style trees in C++17
  ☆373Updated last year
• scandum / wolfsort
  Wolfsort is a stable adaptive hybrid radix / merge sort.
  ☆197Updated last year
• skarupke / branchless_binary_search
  A fast binary search that tries to be branchless
  ☆103Updated last year
• nadavrot / memset_benchmark
  This repository contains high-performance implementations of memset and memcpy in assembly.
  ☆337Updated 3 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆125Updated 3 years ago
• jart / morton
  ☆295Updated last year
• wader / jqjq
  jq implementation of jq
  ☆758Updated 2 weeks ago
• jzimmerman / langcc
  langcc: A Next-Generation Compiler Compiler
  ☆1,728Updated 2 years ago
• wangyi-fudan / wyhash
  The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
  ☆1,065Updated last year
• thradams / cake
  Cake a C23 front end and transpiler written in C
  ☆631Updated this week
• ern0 / howto-wasm-minimal
  How to create minimal wasm module with plain C/C++
  ☆532Updated 2 years ago
• mkirchner / hamt
  A hash array-mapped trie implementation in C
  ☆319Updated last year
• aappleby / matcheroni
  A minimalist single-header library for building pattern-matchers, lexers, and parsers.
  ☆209Updated 5 months ago
• eduard-permyakov / peredvizhnikov-engine
  A fully lock-free game engine written in C++20
  ☆739Updated 2 years ago
• CouleeApps / git-power
  git is a blockchain. Start your commit hashes with 00000000 like a real blockchain should.
  ☆260Updated last year