Last update: Wed Sep 26 02:07:32 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Haynes:1995:ERU,
author = "S. M. Haynes",
title = "Explaining recursion to the unsophisticated",
journal = j-SIGCSE,
volume = "27",
number = "3",
pages = "3--6",
month = sep,
year = "1995",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/209849.209850",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 18:57:31 MST 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
abstract = "This paper addresses the topic of explaining recursion
to Beginning programmers. It briefly presents the
common approaches, then describes an extension to those
methods called the activation tree.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
Related entries
- activation,
23(3)17,
30(1)53
- address,
22(2)2,
23(3)36,
24(2)2,
24(4)43,
25(3)39,
26(1)92,
26(1)243,
26(2)52,
26(4)5,
27(1)204,
27(1)253,
28(1)73,
28(1)88,
28(1)363,
28(2)21,
28(3)23,
28(4)3,
29(1)111,
29(1)131,
29(1)282,
29(1)355,
29(1)384,
29(3)77,
30(1)35,
30(1)153,
30(1)161,
30(1)194,
30(2)48,
30(3)28,
30(3)117,
30(3)193,
30(3)209,
30(3)260,
31(1)73,
31(1)345,
31(2)31,
31(3)21,
31(3)107,
31(3)123,
31(3)143,
31(4)13,
31(4)35,
31(4)66
- beginning,
22(2)42,
23(4)13,
24(1)67,
24(1)134,
25(2)31,
26(1)188,
26(1)286,
26(1)324,
26(2)36,
26(4)21,
27(1)48,
28(1)300,
28(2)25,
28(2)49,
29(1)131,
29(4)62,
30(1)73,
30(1)232,
30(1)262,
30(1)365,
30(2)48,
30(3)105,
30(3)213,
30(3)219,
31(1)271,
31(1)286,
31(3)40,
31(3)147
- briefly,
25(4)33,
26(1)281,
26(4)2,
28(1)88,
28(1)102,
29(2)23,
29(3)51,
29(3)85,
29(3)133,
30(1)171,
30(1)237,
30(3)86,
30(3)134,
31(1)27,
31(2)17
- called,
22(2)15,
24(1)163,
24(2)7,
26(1)46,
26(1)188,
26(1)193,
26(1)290,
26(1)344,
26(4)45,
26(4)56,
27(1)355,
29(1)335,
29(3)27,
29(3)133,
29(4)58,
30(1)45,
30(1)92,
30(1)194,
30(3)125,
31(1)48,
31(1)266,
31(1)346,
31(3)107,
31(3)127,
31(3)139,
31(3)163
- common,
23(3)7,
24(1)173,
24(2)35,
24(3)11,
25(2)59,
26(1)51,
26(1)169,
26(1)400,
26(2)52,
28(1)78,
28(1)195,
28(1)204,
28(4)36,
29(1)20,
29(1)67,
29(1)145,
29(3)1,
29(3)71,
29(4)51,
30(1)6,
30(1)145,
30(1)176,
30(1)336,
30(3)41,
30(3)162,
30(4)46,
31(1)83,
31(1)95,
31(1)122,
31(1)203,
31(1)316,
31(2)62,
31(3)111
- explaining,
25(4)9,
28(1)217,
30(1)97
- extension,
23(2)51,
23(4)31,
25(4)5,
28(1)130,
29(1)121,
29(1)277,
29(1)355,
30(1)341,
31(3)151
- programmer,
23(1)277,
23(3)31,
24(1)92,
24(1)220,
24(1)309,
24(3)14,
24(4)43,
24(4)49,
25(1)160,
26(1)281,
26(1)286,
26(1)366,
26(4)29,
27(1)1,
27(1)48,
27(1)168,
27(3)47,
28(1)217,
28(1)310,
28(4)25,
28(z)49,
29(1)135,
29(1)229,
29(1)315,
29(2)17,
30(1)292,
30(1)370,
30(2)48,
30(4)16,
31(1)58,
31(1)247,
31(2)65,
31(2)69,
31(3)139,
31(4)42
- recursion,
25(2)12,
26(1)300,
27(4)13,
28(1)319,
28(3)60,
28(z)232,
29(3)74,
30(1)185,
30(1)222,
30(1)292,
30(4)51,
31(1)87,
31(1)127,
31(1)136,
31(2)60
- then,
22(3)21,
22(4)5,
23(1)130,
23(2)60,
23(3)36,
24(1)197,
24(1)207,
25(2)51,
26(1)111,
26(1)238,
26(1)281,
26(1)300,
26(2)9,
26(4)9,
27(1)248,
27(1)350,
27(2)25,
27(4)51,
28(1)47,
28(1)217,
28(1)266,
28(2)3,
28(2)40,
28(3)2,
28(3)9,
29(1)39,
29(1)58,
29(1)219,
29(1)330,
29(2)7,
29(3)31,
30(1)6,
30(1)102,
30(1)166,
30(1)237,
30(1)287,
30(1)297,
30(1)302,
30(1)341,
30(1)365,
30(1)383,
30(2)28,
30(3)5,
30(3)37,
30(3)46,
30(3)55,
30(3)59,
30(3)90,
30(3)249,
30(3)260,
31(1)189,
31(1)336,
31(1)343,
31(1)346,
31(2)28,
31(2)84,
31(3)5,
31(3)9,
31(3)99,
31(3)123,
31(3)155,
31(4)13
- tree,
22(3)7,
23(3)10,
23(4)7,
27(1)61,
27(1)66,
28(1)185,
28(3)29,
28(4)36,
29(1)15,
29(1)72,
29(1)159,
29(1)233,
30(1)185,
30(1)232,
30(1)267,
30(1)336,
31(3)197
- unsophisticated,
27(3)7