Also useful to generate subsets since possible the number of subsets of a set of n elements is 2^n.

   for (int i = 0; i << n; i++) {
      ...
   }

(won't work for a large n)

Also... dividing by 2 is (n >> 1) and multiplying by 2 is (n << 1).