CareerCup

#include <stdio .h>

void sub(int *a) {
	int b;

	if (&b > a) {
		printf("Stack grows up.");
	} else {
		printf("Stack grows down.");
	}
}

main () {
	int a;
	sub(&a);

}

Need to note that if you define two integers in main() and print their addresses out, you may think it could give you some idea that how stack grows but actually it can't, cauz that program may be optimized by the compiler so that the definition order may not be the execution order. You just cannot trust the result.

one can easily determine the stack direction by declaring one integer in main and other one in a function , called in main.

As far as "which is Better? " question is considered, I don't think it really matters....They both are good as they both move towards center of memory allocated....

here s what i did..
main(){
int a;
printf("addr of main=%u",main);
printf("addr of a=%u",&a);
sub();
}
sub(){
int b;
printf("addr of sub=%u",sub);
printf("addr of b=%u",&b);
}

..in the result i got addr of main < addr of sub .. but addr of a > addr of b..
Could anyone explain this or where im wrong ??
Thanks in advance.

You can call some function. Optimizer cannot change call's stack frame.
Something like that:

int* foo()
{
int a;

return &a;
}

bool bar()
{
int b;
int* pa = foo();

return pa > &b;
}

but i will also like to add
The expression (&b > a) is undefined.

The result of comparing two pointers using is defined only if the two pointers point to elements within the same array or structure.

The standard says nothing about the direction of the stack or if a stack even exists.

head or tail [up or down] doesn't effect a stack implemented by Single or Double linked list.
Front or Back effects a stack implemented by Array. Front is less efficient.