Given a set of unsigned integers. How can I find the bit-permutation so that the maximum number is minimal?
-
Trying to understand your unstated assumptions/rules: So you are allowed to only swap 2 bits? And you have to use the same permutation for each integer?
You are allowed to swap any bits. So for N bit numbers we are looking at N! possible permutations. We'd like to find one permutation so that, when applied to all numbers, the maximum number after permutation is smaller or equal than what you'd get for any other permutation.
-
-
Ok. So it starts trivially with: any bit positions where everything is a 0 get sorted to the man and any bit position where everything is a 1 get sorted to the lab. And then it gets interesting...
-
Damn spelling correction! man=msb and lab=lsb.
- Show replies
New conversation -
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.