CareerCup

int main()
{
    int local1;
    stack(&local1);
    exit(0);
}

void stack(int *local1)
{
    int local2;
    printf("\nAddress of first local : [%u]", local1);
    printf("\nAddress of second local : [%u]", &local2);
    if(local1 < &local2)
    {
        printf("\nStack is growing to higher address.\n");
    }
    else
    {
        printf("\nStack is growing to lower address.\n");
    }
    printf("\n\n");
}

Anyone?

any recursion funtion
just print the local variable address
by seeing the address find the growth direction

factorial(int n)
{

}

any recursion funtion
just print the local variable address
by seeing the address find the growth direction

factorial(int n)
{
int i;
printf("%u", &i)
if(n == 1) return 1;
return n * factorial(n - 1)
}
main ()
{
int i = 5;
factorail(i);
}

since local variables are stored in stack,hence,decalre a local variable & maintain pointer to it.Now,increment pointer by one and print the address & compare with the previous value.if +ve then stack grows up else grows down