Notes on recursion elimination
- 1 June 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (6) , 434-439
- https://doi.org/10.1145/359605.359630
Abstract
Various methods of recursion elimination are applied to the schematic recursive procedure: proc S ( x ); px then N ( x ); S (ƒ x ); S ( gx ); M ( x ) fi. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time.Keywords
This publication has 5 references indexed in Scilit:
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Translating recursion equations into flow chartsJournal of Computer and System Sciences, 1971
- Another recursion induction principleCommunications of the ACM, 1971
- QuicksortThe Computer Journal, 1962
- Recursive ProgrammingNumerische Mathematik, 1960