int MAX = (1 << n);
for (int i = 0, revi = 0; i < MAX; ++i) {
  int bit = (MAX >> 1);
  for (; revi & bit; bit >>= 1)
    revi ^= bit;
  revi |= bit;

  reversed[i] = revi;
}