In fact, you can use the second algorithm mentioned there, with a slight modification:
In the special case of b being of the form 0n1m
(a > b) == !!(a & ~b)
holds.
↧
Answer by Brave Sir Robin for Create a mask that marks the most significant set bit, using only bitwise operators
↧