Recursion versus non-recursion in Pascal: recursion can be faster-Reference-Cited by-同舟云学术

Recursion versus non-recursion in Pascal: recursion can be faster

Published:1987-02 Issue:2 Volume:22 Page:62-67
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Louden K¹

Affiliation:

1. Department of Mathematics and Computer Science, San Jose State University, San Jose, CA

Abstract

A timing study of two Pascal programs on three machines provides some evidence that, for modern machines and compilers, the cost of removing recursion in non-trivial situations can sometimes be greater than the cost of the recursive procedure calls.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/24686.24691

Reference6 articles.

1. [ 1 ] Aho Alfred V. John Hopcroft and Jeffrey Ullman Data Structures and Algorithms Addison-Wesley 1983. [1] Aho Alfred V. John Hopcroft and Jeffrey Ullman Data Structures and Algorithms Addison-Wesley 1983.

2. [ 2 ] Horowitz Ellis and Sartaj Sahni Fundamentals of Data Structures in Pascal Computer Science Press 1984. [2] Horowitz Ellis and Sartaj Sahni Fundamentals of Data Structures in Pascal Computer Science Press 1984.

3. [ 3 ] Ford Gary and Richard Wiener Modula-2 - A Software Development Approach John Wiley & Sons 1985. [3] Ford Gary and Richard Wiener Modula-2 - A Software Development Approach John Wiley & Sons 1985.

4. [ 4 ] Sahni Sartaj Software Development in Pascal Camelot 1985. [4] Sahni Sartaj Software Development in Pascal Camelot 1985.

5. [ 5 ] Sedgewick Robert Algorithms Addison-Wesley 1983. [5] Sedgewick Robert Algorithms Addison-Wesley 1983.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Recursion vs. nonrecursion in Pascal: a rejoinder;ACM SIGPLAN Notices;1987-09

2. ACM forum;Communications of the ACM;1987-05