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

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1987 English Publisher:Association for Computing Machinery (ACM)Journal:ACM SIGPLAN Notices, volume 22, pages 62-67 (issn: 0362-1340, eissn: 1558-1160,

Copyright policy )

Authors: Kenneth C. Louden;

doi: 10.1145/24686.24691

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

- Summary
- Metrics

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.

Related Organizations

San Jose State University
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average