Bitwise logical operator

One 、 According to the not ：~

In the computer , Data is stored in binary , Even with the original code 、 Inverse code 、 Complement code . Binary numbers are stored in memory in the form of complements .

According to the not Is to take each digit of the complement inversely , namely 0 change 1,1 change 0;

#include <stdio.h>
int main()
{
    
    char a = 5;
    printf("%d", ~a);
    return 0;
}

The result is -6;

 Positive integer ：5
 The original code of a positive number 、 Inverse code 、 The complement is the same ：00000101
 According to the not ：11111010	// At this time, the reverse result is the original code , It also needs to be converted into a complement 
 Inverse code ：10000101
 Complement code ：10000110			
 result ：-6


 Negtive integer ：-5
 Original code ：10000101
 Inverse code ：11111010
 Complement code ：11111011
 According to the not ：00000100		// At this time, the reverse result is the original code , Because the original code is positive , The former is the same as the latter 
 result ：4

The bitwise negation of a positive number equals itself +1 The negative number of
The bitwise negation of a negative number equals itself +1 Positive number of
0 Reverse by bit to -1

Two 、 Bitwise AND ：&

[ The rules ]
0&0=0
0&1=0
1&0=0
1&1=1

#include <stdio.h>
int main()
{
    
    char a = 5,b=9;
    char c = a&b;
    printf("%d", c);
    return 0;
}

The result is 1

5 Complement ：00000101
9 Complement ：00001001
 Bitwise and post results ：00000001		// At this time, the result is the original code , Because the original code is positive , The former is the same as the latter 
 result ：1

3、 ... and 、 Press bit or ：|

[ The rules ]
0|0=0
0|1=1
1|0=1
1|1=1

#include <stdio.h>
int main()
{
    
    char a = 5,b=9;
    char c = a|b;
    printf("%d", c);
    return 0;
}

The result is 13

5 Complement ：00000101
9 Complement ：00001001
 Bitwise or post result ：00001101			// At this time, the result is the original code , Because the original code is positive , The former is the same as the latter 
 result ：13

Four 、 Bitwise XOR ：^

[ The rules ]
0^0=0
0^1=1
1^0=1
1^1=0

#include <stdio.h>
int main()
{
    
    char a = 5,b=9;
    char c = a^b;
    printf("%d", c);
    return 0;
}

The result is 12

5 Complement ：00000101
9 Complement ：00001001
 Bitwise and or post result ：00001100		// At this time, the result is the original code , Because the original code is positive , The former is the same as the latter 
 result ：12