A helper method which efficiently calculates the unique integer in an interval [a, b] which has the maximum number of trailing zeros in its binary representation (a and b are integers > 0).
A helper method which efficiently calculates the unique integer in an interval [a, b] which has
the maximum number of trailing zeros in its binary representation (a and b are integers > 0).
This is used by the HyperCube implementations to find the greatest interesting square for
two given children.
Thanks to Rex Kerr and Daniel Sobral ( http://stackoverflow.com/questions/6156502/integer-in-an-interval-with-maximized-number-of-trailing-zero-bits )