3 ms·

> Avoiding either > Easily predicted branch Branchless code can easily out-cost a well-predicted branch (and its content if any).

• taeric 4y ago
  This is where I was trying to use sorting networks as a fun example. Without independent compare/swap units, they will go slower than sequential sorting. Despite not necessarily "branching."
• mhh__ 4y ago
  Of course, perhaps this should be reduced to "keep an eye out for silly branches"