Interesting, no, and yes, lol.
All I had to do, was count the underscores to find which identifiers were which, as soon as I spotted the recursive call (~3 seconds later) it was obvious that displays a sequence of 25 numbers. The only 'hard' part was double checking if the sequence were fibonacci numbers, if you call that hard. (I stopped thinking after mentally compiling '5').
Maybe try writing a java virtual machine in brainfuck next time? hehe.
__________________
My Journal
Thou shalt check the array bounds of all strings (indeed, all arrays), for surely where thou typest ``foo'' someone someday shall type ``supercalifragilisticexpialidocious''.
|