Branchless Quicksort: How Modern Compilers Optimize Code with the Right Programming Style
Recently, while I was working on an optimized Quicksort implementation, I came across a rather interesting quirk. Modern compilers (especially Clang) optimize loops using fast, branch-free…
Read the full articleYou might also wanna read
Understanding CPU Branch Prediction and Branchless Programming in C++
Stop letting CPU mispredictions slow down your code. This guide covers C++ branch prediction internals, branchless programming patterns, and
towardsdev.com·18d ago
Building Faster Parsers Through Data-Oriented Design: Flat Arrays Over Pointer Trees
How designing the data structure first (flat arrays of indices instead of a pointer tree) makes a parser fast and collapses memory layout, a
arshad.fyi·13d ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.