>>I was doing some research on recursion; I believe that other than recursion, there would be no need to increase the stack size. Probably with recursion, the need to increase it might also indicate a bad design, but in any case, I wanted to know!
>
>What level of recursion has to do with the quality of design?
It may have to do in some cases. An example frequently cited for recursion is the factorial function: 4! = 1 * 2 * 3 * 4, which may also be defined as n! = n * (n-1)! There is nothing wrong with this mathematical definition, but making a recursive function out of it is inefficient.
>Btw, the recursion with a function call has much lower limit - 743.
So a function can't call itself more than 743 levels deep? Then, what does the STACKSIZE refer to, which can supposedly be increased up to 64000?
Difference in opinions hath cost many millions of lives: for instance, whether flesh be bread, or bread be flesh; whether whistling be a vice or a virtue; whether it be better to kiss a post, or throw it into the fire... (from Gulliver's Travels)
