![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CSAPP
BadGeekChris
CMU CSer
展开
-
DataLab
/* * bitXor - x^y using only ~ and & * Example: bitXor(4, 5) = 1 * Legal ops: ~ & * Max ops: 14 * Rating: 1 */ int bitXor(int x, int y) { // De-Morgan's Law // x XOR y = (~x)y+x(~y) int r1=~(~x&y); int r2=~(x&~y.原创 2021-08-19 12:11:13 · 149 阅读 · 0 评论 -
位操作技巧:Bit Twiddling Hacks
Bit Twiddling Hacks 这是CMU推荐学生去读的一份位操作的讲义: https://graphics.stanford.edu/~seander/bithacks.html原创 2021-08-17 18:00:56 · 92 阅读 · 0 评论 -
为什么阶码要有偏置常数?
Why do we need biased exponent ? Introduction: The following algorithm (for an n-bit two’s complement architecture) sets the result register R to −1 if A < B, to +1 if A > B, and to 0 if A and B are equal: // reversed comparison of the sign bit if A原创 2021-08-17 17:45:46 · 807 阅读 · 0 评论