Given a set of unsigned integers. How can I find the bit-permutation so that the maximum number is minimal?
-
I mean a bit position where they're all zero.
That method would suggest that for the set 001, 100, 110 the order does not matter, because there are zeros and ones in each position. But obviously the order does matter, because swapping the middle and LSB bit will reduce the max from 110 to 101.
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.