Bit masks enable the simultaneous storage and retrieval of multiple values using one variable. This is done by using flags with special properties (numbers that are the powers of 2). It becomes trivial to symbolize membership by checking if the bit at a position is 1 or 0.
Simple loops can be boring, after all, why not have the collection change during a looping operation for more fun?
I try to read a lot of books. Over the years, my 'taste' for books has been refined and some of my criteria are listed below.
I have made a couple of mistakes over the years and wanted to share those pitfalls so upcoming programmers know what to avoid and what works.