Part of the Lecture Notes in Computer Science book series (LNCS, volume 79)
Recursion as a programming technique has been with us for over two decades now, and yet it still retains a certain mystery. In this paper we consider the objections to it and the claims for it.
KeywordsRecursive Procedure Fibonacci Number Binary Search Tree Time Penalty Partial Permutation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 1.ALAGIC, S and ARBIB, M.A. (1978): "The Design of Well-Structured and Correct Programs", Springer-Verlag.Google Scholar
- 2.BIRD, R.S. (1977): "Notes on Recursion Elimination", Comm ACM, Vol.20, p.434.Google Scholar
- 3.FIKE, C.T. (1975): "A Permutation Generation Method", Computer Journal, Vol. 18, p.21.Google Scholar
- 4.GRIFFITHS, M. (1975): "Requirements for and Problems with Intermediate Languages for Programming Language Implementation" (Lecture notes for the NATO International Summer School, Marktoberdorf, W. Germany).Google Scholar
- 5.HEAP, B.R. (1963): "Permutations by Interchanges", Computer Journal, Vol. 6, pp 293–4.Google Scholar
- 6.KNUTH, D.E. (1974): "Structured Programming with Goto Statements", Computing Surveys, Vol. 6, p.261.Google Scholar
- 7.ROHL, J.S. (1976): "Programming Improvements to Fike's Algorithm for Generating Permutations", Computer Journal, Vol 19, p. 156.Google Scholar
- 8.ROHL, J.S. (1977): "Converting a Class of Recursive Procedures into Non-recursive Ones", Software — Practice & Experience, Vol. 7, p.231.Google Scholar
- 9.WIRTH, N. (1976): "Algorithms + Data Structures = Programs", Prentice-Hall.Google Scholar
© Springer-Verlag Berlin Heidelberg 1980