Fast Branchless Quicksort for C and C++ - Single- and Multithreaded Versions
-
Updated
Sep 25, 2026 - C++
Fast Branchless Quicksort for C and C++ - Single- and Multithreaded Versions
One header file library that implement missing transcendental math functions (cos, sin, acos, and more....) using 100% AVX/Neon instructions (no branching)
The fastest “branch less” binary search implementation for cheap comparisons cases (with workaround for LLVM optimizer flaw).
Pure-branchless, low-latency, high-performance autopilot stack - in active development
A demonstration of branchless programming technique. Using benchmarks, shows that this technique boosts performance significantly.
Allow to compile and compress branchless batch expression
Learn branchless programming techniques through practical examples across multiple languages.
Legacy roguelike refactor. Moria -> C23. Bitmask spell logic. Branchless math. goto Data-oriented. Mechanical sympathy. High-performance maintenance
To associate your repository with the branchless-code topic, visit your repo's landing page and select "manage topics."