Understanding Left and Right Bitwise shift on a 128-bit number?

This technique is somewhat idiomatic. Let's simplify to just a and be . We start with.

When the bits of a get shifted to the left, something has to fill in the space left over on the right end. Since a and be are conceptually adjacent to each other, the void left by shifting the bits of a gets filled by the bits that are shifted off the end of b. The expression be >> (32-k) computes the bits that get shifted off of b.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.