Re: [SLUG] Re: Help Me - C codes

2005-11-29 Thread yiz
lol, the command I found most useful in gdb is 'where'. $gdb ./a.out (gdb)run (gdb)where prolly becoz my code core dumps a lot, but that's not the point >_< yiz O Plameras had suggested gdb in previous post these easy to follow steps: 1. Compile as cc -g factorial.c -o factorial ( I lear

Re: [SLUG] Re: Help Me - C codes

2005-11-29 Thread Beav Petrie
On 11/30/05, Matthew Hannigan <[EMAIL PROTECTED]> wrote: On Tue, Nov 29, 2005 at 01:13:48PM +1100, Beav Petrie wrote:> I had seen the stacking up with gdb program, which I> learned with no hassles. Now, I can't do without it in myExcellent!  I was going to suggest going the 'low road' to understand

Re: [SLUG] Re: Help Me - C codes

2005-11-29 Thread Matthew Hannigan
On Tue, Nov 29, 2005 at 01:13:48PM +1100, Beav Petrie wrote: > I had seen the stacking up with gdb program, which I > learned with no hassles. Now, I can't do without it in my Excellent! I was going to suggest going the 'low road' to understanding recursion but weren't sure of your level of knowl

[SLUG] Re: Help Me - C codes

2005-11-29 Thread Beav Petrie
Sluggers, Thanks lots. I understand clearly, why 24 instead of 1 is printed, now. When y is 0 (y<1) finally, the program had stacked up 4*3*2*1 by doing factorial(y) repeatedly which is cool. Multiply by 1 (return 1, when y<1), 4*3*2*1*1 gives 24. Very, very cool. I had seen the stacking up wi