How does this C programme work with recursive functions?

  • Thread starter Thread starter rclakmal
  • Start date Start date
  • Tags Tags
    Explain
AI Thread Summary
The C program demonstrates recursion through the function `func`, which prints numbers in ascending order from 0 to the initial argument passed to it. When `func(4)` is called, the function checks if the input `x` is greater than 0. If true, it recursively calls itself with `x-1`. This continues until `x` reaches 0, at which point the function does not call itself further and begins to print the values of `x` as the recursion unwinds. The output is generated in the order of 0, 1, 2, 3, and 4, as each level of the recursive call prints its respective value after returning from the deeper calls. Understanding the execution stack is crucial, as each call to `func` creates a new frame with its own variable `x`, allowing the function to maintain separate values at each level of recursion.
rclakmal
Messages
76
Reaction score
0
explain this C programme??

#include<stdio.h>
void func (int x);
void func(int x)
{
if (x>0)
func(x-1);
printf("%d",x);
}
int main()
{
func(4);
return 0;
}

this C programme gives the output of

0 1 2 3 4

can anyone explain me how this happens I am totally confused ...
 
Technology news on Phys.org


No explanation will be nearly as useful as you working it out yourself. Trace the execution of your program by hand. What is the very first thing it does when it's started?
 


yr i tried like that ,...but according to my dry run

first function get 4 and its greater than 0 and coz of that function get 3 like wise it goes until 1 then when the function get 1 and as it is also greater than 0 function get 0.Then 0 is NOT greater than 0 .so if loop is skipped then the 0 will be printed .but how on the Earth these 1234 gets print out ....i don't how it happens please help me ...please ignore my dumbness if this is a very easy one ...:D
 


Think about flow of control. How do these functions get called exactly? Ever heard of recursion?
 


Need more explanation .!Badly needed...!yr of course i have heard about recursion ...its about calling a function inside it self which is same as here ...but can u please help me with the dry run ...it will be a great help ...coz I am doing 6 subjects and don't have enough time to think about 1 for a long ...exam is coming on the way ...any help would be greatly appreciated.thanks!
 


Speak English, please; save the txtk for texting.


I think you haven't internalized the notion of an execution stack. You've realized that func gets called five times, but it looks like you've mentally merged all of them together.

But that's not what happens -- each of the five calls to func give five completely different "frames", and you have to keep track of them all and keep them separate.
 


Here's a simple example... call func with 2.

Code:
func(2)
...x=2
   x>2?
      yes, so...func(2-1)
                   ...x=1 ... this is a new "x" variable for this level.
                   ...x>0?
                         yes, so...func(1-1)
                                      ...x=0 ... this is another new "x" variable.
                                         x>0? no.
                                         print "0"
                   print "1"... remember, x was "1" at this level.
   print "2" ... again, x was "2" at this level.
 
Back
Top