{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:01:17Z","timestamp":1693864877053},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[1982,6]]},"abstract":"Recursion is presented as a generalized control structure, with iteration being a special case. A method is described to determine when to use recursion and when to use iteration in designing an algorithm to solve a problem.<\/jats:p>","DOI":"10.1145\/989314.989320","type":"journal-article","created":{"date-parts":[[2004,7,21]],"date-time":"2004-07-21T22:43:36Z","timestamp":1090449816000},"page":"32-39","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["A framework for teaching recursion"],"prefix":"10.1145","volume":"14","author":[{"given":"Gary","family":"Ford","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, Arizona"}]}],"member":"320","published-online":{"date-parts":[[1982,6]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"The Design and Analysis of Algorithms","author":"Aho A.","year":"1974","unstructured":"Aho , A. , J. Hopcroft , and J. Ullman . The Design and Analysis of Algorithms . Addison Wesley , 1974 . Aho, A., J. Hopcroft, and J. Ullman. The Design and Analysis of Algorithms. Addison Wesley, 1974."},{"key":"e_1_2_1_2_1","volume-title":"Computer Algorithms: Introduction to Design and Analysis","author":"Baase S.","year":"1978","unstructured":"Baase , S. Computer Algorithms: Introduction to Design and Analysis . Addison Wesley , 1978 . Baase, S. Computer Algorithms: Introduction to Design and Analysis. Addison Wesley, 1978."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356831"},{"key":"e_1_2_1_4_1","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"Goodman S.","year":"1977","unstructured":"Goodman , S. and S. Hedetniemi . Introduction to the Design and Analysis of Algorithms . McGraw-Hill , 1977 . Goodman, S. and S. Hedetniemi. Introduction to the Design and Analysis of Algorithms. McGraw-Hill, 1977."},{"key":"e_1_2_1_5_1","volume-title":"Programming in Pascal (Revised Edition)","author":"Grogono P.","year":"1980","unstructured":"Grogono , P. Programming in Pascal (Revised Edition) . Addison Wesley , 1980 . Grogono, P. Programming in Pascal (Revised Edition). Addison Wesley, 1980."},{"key":"e_1_2_1_6_1","volume-title":"Fundamentals of Computer Algorithms","author":"Horowitz E.","year":"1978","unstructured":"Horowitz , E. , and S. Sahni . Fundamentals of Computer Algorithms . Computer Science Press , 1978 . Horowitz, E., and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978."},{"key":"e_1_2_1_7_1","volume-title":"Fundamental Algorithms","author":"Knuth D.","year":"1973","unstructured":"Knuth , D. The Art of Computer Programming , Vol. 1 : Fundamental Algorithms ( Second Edition). Addison Wesley , 1973 . Knuth, D. The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Second Edition). Addison Wesley, 1973."},{"key":"e_1_2_1_8_1","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold E.","year":"1977","unstructured":"Reingold , E. , J. Nievergelt , and N. Deo . Combinatorial Algorithms: Theory and Practice . Prentice Hall , 1977 . Reingold, E., J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice. Prentice Hall, 1977."},{"key":"e_1_2_1_9_1","volume-title":"An Introduction to Programming and Problem Solving with Pascal","author":"Schneider G.","year":"1978","unstructured":"Schneider , G. , S. Weingart , and D. Perlman . An Introduction to Programming and Problem Solving with Pascal . Wiley , 1978 . Schneider, G., S. Weingart, and D. Perlman. An Introduction to Programming and Problem Solving with Pascal. Wiley, 1978."},{"key":"e_1_2_1_10_1","volume-title":"Data Structures using Pascal","author":"Tenenbaum A.","year":"1981","unstructured":"Tenenbaum , A. , and M. Augenstein . Data Structures using Pascal . Prentice Hall , 1981 . Tenenbaum, A., and M. Augenstein. Data Structures using Pascal. Prentice Hall, 1981."},{"key":"e_1_2_1_11_1","volume-title":"An Introduction to Data Structures with Applications","author":"Tremblay J.","year":"1976","unstructured":"Tremblay , J. , and P. Sorenson . An Introduction to Data Structures with Applications . McGraw-Hill , 1976 . Tremblay, J., and P. Sorenson. An Introduction to Data Structures with Applications. McGraw-Hill, 1976."},{"key":"e_1_2_1_12_1","volume-title":"Algorithms + Data Structures = Programs","author":"Wirth N.","year":"1976","unstructured":"Wirth , N. Algorithms + Data Structures = Programs . Prentice Hall , 1976 . Wirth, N. Algorithms + Data Structures = Programs. Prentice Hall, 1976."}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/989314.989320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T11:11:45Z","timestamp":1672744305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/989314.989320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["10.1145\/989314.989320"],"URL":"https:\/\/doi.org\/10.1145\/989314.989320","relation":{},"ISSN":["0097-8418"],"issn-type":[{"value":"0097-8418","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]},"assertion":[{"value":"1982-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}