本文介绍了一种高效实现8位字节位序反转的算法。通过使用位操作指令，如右移和左移结合按位与运算，逐步实现了从高位到低位的反转过程。最终得到的算法简洁且易于理解。
Given a 8-bit byte, assume its bits are b8b7...b1.
Provide an algorithm to reverse the bit sequence.
Result should be b1b2b3...b8.
An simple answer:
Suppose the byte is c.
c=((c>>1) & 0x55) | ((c<<1) & 0xAA)); // we got 78563412
c=((c>>2) & 0x33) | ((c<<2) & 0xCC)); // we got 56781234
c=((c>>4) | (c<<4)); // we got 12345678
Provide an algorithm to reverse the bit sequence.
Result should be b1b2b3...b8.
An simple answer:
Suppose the byte is c.
c=((c>>1) & 0x55) | ((c<<1) & 0xAA)); // we got 78563412
c=((c>>2) & 0x33) | ((c<<2) & 0xCC)); // we got 56781234
c=((c>>4) | (c<<4)); // we got 12345678
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
