Computer science sophomores learn that recursion can neatly solve complex problems, e.g., Hanoi rings, wildcard handling, and parsing. In practice, however, recursion can be problematic for several reasons. First of
An assignment expression can appear inside an if condition: if (x = getval() ) { // do someting } The if condition is evaluated in two steps: first, the unconditional
A derived class’s member-initialization list can initialize any non-ambiguous member of its class, including base subobjects. Suppose you have a class C that is derived from B, which is in
By default, a typedef name declared in the global scope has internal linkage. This means that separately compiled source files can’t refer to a typedef declared in another source file,
An equality expression takes two operands, the second of which is often a constant or an rvalue: if (x==4) // 4 is an rvalue // .. do something if (y!=MAX_COUNT)