Re:Why is processing a sorted array faster than an unsorted ...
by mtdewcmu on Friday June 28, 2013 @09:13PM
(#5961169)
In the answers to the original question, somebody mentioned that gcc will convert branches into conditional moves, but only at -O3. I never use -O3, because it's frequently slower than -O2. In another answer, somebody pointed out that the ternary operator always generates a conditional move, which I never knew.
[ Parent
| on HN ]
There are no comments on this comment yet.