Get the maximum integer

int maxInt = ~(1 << 31);\nint maxInt = (1 << 31) - 1;\nint maxInt = (1 << -1) - 1;\n

Get the minimum integer

int minInt = 1 << 31;\nint minInt = 1 << -1;\n

Get the maximum long

long maxLong = ((long)1 << 127) - 1;\n

Multiplied by 2

n << 1; // n*2\n

Divided by 2

n >> 1; // n/2\n

Multiplied by the m-th power of 2

n << m;\n

Divided by the m-th power of 2

n >> m;\n

Check odd number

(n & 1) == 1;\n

Exchange two values

a ^= b;\nb ^= a;\na ^= b;\n

Get absolute value

(n ^ (n >> 31)) - (n >> 31);\n

Get the max of two values

b & ((a-b) >> 31) | a & (~(a-b) >> 31);\n

Get the min of two values

a & ((a-b) >> 31) | b & (~(a-b) >> 31);\n

Check whether both have the same sign

(x ^ y) >= 0;\n

Calculate 2^n

2 << (n-1);\n

Whether is factorial of 2

n > 0 ? (n & (n - 1)) == 0 : false;\n

Modulo 2^n against m

m & (n - 1);\n

Get the average

(x + y) >> 1;\n((x ^ y) >> 1) + (x & y);\n

Get the m-th bit of n (from low to high)

(n >> (m-1)) & 1;\n

Set the m-th bit of n to 0 (from low to high)

n & ~(1 << (m-1));\n

n + 1

-~n\n

n - 1

~-n\n

Get the contrast number

~n + 1;\n(n ^ -1) + 1; \n

if (x==a) x=b; if (x==b) x=a;

x = a ^ b ^ x;

Algorithms, Data Structures, Computer Science, Math