Man, finally have some time in between virus attacks...
Jooel, the purpose of this is to list in decimal format the bits that make up a bitwise value. For instance, 27 is created by the bits 16,8,2,1. I suppose a & is the simplest way, but I just don't find it readable, and now I have all the bits at hand in one operation.
Howard, nice code for the recursive version.
Maciep, this seemed like a decent task to perform recursion on. Your solution is terrific. I really am trying to get a better hold on recursion cuz it's just so damn confusing, but in some cases, it can really save some rewriting; not to mention the elegance of a nicely formed recursive operation. Judging by Howard's code, this isn't as simple as I first thought it would be.
_________________________
-Jim
...the sort of general malaise that only the genius possess and the insane lament.
