| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | trap 0005 |
Hallo, Mario!
*** Am 20. M„rz 1997 um 07:53 schrieb Mario Semo an Henk den Adel:
MS> void stackEater(int x)
MS> {
MS> if (x==0) return;
MS> char c[1000];
This is not legal C.
Since it is end-recursive you can calculate the result for any given starting value.
Since the local value is not used, the answer can be given ad hoc: zero for
local variables plus processor dependant for return stack.
You simply wanted to say: recursive functions add another magnitude of problems :-)
Tschau...Thomas
--- E3-32/1.11-32/2.51+
* Origin: Die TeX-Box +49-6034-930021 V.34 -930022 ISDN 24h (2:244/1130.42)SEEN-BY: 50/99 54/99 270/101 620/243 625/155 711/401 413 430 934 712/311 407 SEEN-BY: 712/505 506 517 623 624 704 713/317 800/1 @PATH: 244/1130 1500 396/1 270/101 712/624 711/934 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.