algorithm/BitManipulation

비트마스킹

ayeongjin 2025. 1. 2. 15:01

 

비트연산자

비트연산자  결과값 (a = 0b1010, b = 0b0100)
& (AND) a & b = 0b0000
| (OR) a | b = 0b1110
^ (XOR) a ^ b = 0b1110
~ (NOT) ~a = 0b0101
<< (왼쪽 shift) a << n = a * 2^n
>> (오른쪽 shift) a >> n = a * 2^(-n)