title: Find out max & min of two number without using If else?
body: <p>I am able to find out the logic from: <a href="http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax" rel="nofollow">Here</a></p>
  
  <pre><code>r = y ^ ((x ^ y) &amp; -(x &lt; y)); // min(x, y)
  r = x ^ ((x ^ y) &amp; -(x &lt; y)); // max(x, y)
  </code></pre>
  
  <p>It says it is faster then doing </p>
  
  <pre><code>r = (x &lt; y) ? x : y
  </code></pre>
  
  <p>Can someone explain a bit more about it to understand it with example.
  How it could be faster? </p>