Heap Vs Stack

[Nehil]

I would like to know which is dynamic in nature.
if i refer the C memory model (Richard Steven), it is shown that both
stack and heap grow towards each other.
Now, can one go into other's area and hence effecting the size of
other memory area.

Does any limit exist upto which a stack or a heap can grow. and if it
is there then who decides the limit?

plz clarify.

[Malcolm McLean]

"Keith Thompson" <ks***@mib.orgw rote in message
news:ln******** ****@nuthaus.mi b.org...

"Malcolm McLean" <re*******@btin ternet.comwrite s:

>"Nehil" <ne***********@ gmail.comwrote in message
news:11******* **************@ q75g2000hsh.goo glegroups.com.. .

>>>I would like to know which is dynamic in nature.
if i refer the C memory model (Richard Steven), it is shown that both
stack and heap grow towards each other.
Now, can one go into other's area and hence effecting the size of
other memory area.

Does any limit exist upto which a stack or a heap can grow. and if it
is there then who decides the limit?

Assume a typical structured C program consisting of subroutines that
call each other and pass each other data. As the program grows in size
and complexity, its stack usage will tend to grow as the logarithm of
the number of functions it contains. It's heap usage, however, will
grow linearly with the amount of data it processes. That is beacuse
stack variables are thrown away when the function exits, heap
allocations typically are not.

[...]

You're assuming no recursion. Recursion is common in programs that
process recursively-defined data; the more complex the input data, the
deeper the nested function calls. A compiler with a recursive descent
parser is a good example of this; a program that processes XML is
probably another.

Though even there typically data is designed so that tree depth is pretty
low. For instance a human-readable C source is not going to have any
expressions with more than three levels of paretheses, although it may may
have tens of thousands of such expressions.

Sometimes you get recursion as a lazy man's iteration, however. Then your
objection would be valid.

--
Free games and programming goodies.
http://www.personal.leeds.ac.uk/~bgy1mm

[Mark McIntyre]

On Sun, 08 Jul 2007 17:48:06 -0700, in comp.lang.c , Keith Thompson
<ks***@mib.orgw rote:

>It's true that calling printf without a '#include <stdio.h>' (or a
declaration for printf) invokes undefined behavior, but in practice
it's highly unlikely that that explains the behavior he's seeing.

I'm inclined to agree, but first fix the obvious problems, then look
for less obvious ones...

--
Mark McIntyre

"Debugging is twice as hard as writing the code in the first place.
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it."
--Brian Kernighan