Explain me how the stack looks like for any C program

[ckarthickit]

how the stack would look like for the following program if I give input as 5.

#include <stdio.h>

int fibonacci(int number)
{
  int retval;
  if (0 == number){
    return 0;
  }
  if (1 == number){
    return 1;
  }
  return(fibonacci(number-1) + fibonacci(number-2));
}

int main()
{
  int number = 0;
  int fibvalue = 1;
  while (1){
    printf("please enter the number\n");
    scanf("%d", &number);
    fibvalue = fibonacci(number);
    printf("computed fibonacci value %d\n", fibvalue);
  }
  return 1;
}

[itCbitC]

Depends on the microarchitecture and the direction of stack push/pop.

[nonoob]

The stack will contain return addresses (where the function was called from) as well as any local variables. It is dynamic, so I'm not sure exactly when you'd want to take a snapshot of its contents. I assume the stack will be at its deepest during the fibonacci (number -1) call.