Trying to speed up binary search
&quot;Apparently the conditional move is good to avoid branch mispredictions, but cannot hide memory latency as much as the regular implementation.&quot;<p>Anybody knows what actually happens there? For a real analysis I&#x27;d like to see the generated assembly in a classic and conditional move case, and also an example of the indexes accessed in one and another algorithm.