What is the fastest way to calculate 2 of the 16-time square?

Tag: Represents the binary Java bit Operation shift Operation nbsp Topic Direct Brackets

The fastest operation in the computer is the direct binary operation,

In Java, it is possible to perform binary operations in the preferred bit operation.

The problem is to investigate the shift operation, to understand, left to move <<, which means multiplication, right shift >>

Like the 2 binary 0000 0010, if the left shift 1 is equivalent to (2) * *, the left Shift 2 is equivalent to (2), the left 3 is equivalent to (2) *8,,,,, 2 in parentheses is the original number

So as long as it's multiplied by 2, it can be calculated by shifting.

The answer to that question is, of course,

2<<4

What is the fastest way to calculate 2 of the 16-time square?