How the following program works?

Question

#include <stdio.h>
int foo(int x,int n)
{
int val;
val=1;
if (n>0)
{
if(n%2 == 0)
val=val*x;
val=val*foo(x*x,n/2);
return;
}
}
int main()
{
int r;
r=foo(2,4);
printf("%d",r);
}

Answer 1

This returns 2048 . Why it happens?

Answer 2

Remember that val is changed in the recursive foo call.

So eventually, what's returned will be an a*b*c*d... thing.

Different result on Linux? Strange!

Maybe we should ask someone like ~ swim ~ who *will* have the answer...

Answer 3

If not return statrment means, which value is actually return .... ??

Answer 4

HonFu [#GoGetThatBugChamp!]
No,if return is (return Val )means final recursion stage Val variable contains 1 so the output will be vary but here the program output is 2048 in sololearn compiler and in Linux : 4096

Answer 5

but ~ swim ~ the function should at least return a value, and the value needed to be return is val

Answer 6

Seems like it's val, which is declared first.

You can change the return to return val, and the result is the same.

Answer 7

Output comes same value in Everytime. But garbage not come every time same value