[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

On classifying recursive algorithms

Published: 01 February 1986 Publication History

Abstract

A scheme is presented for classifying recursive problems based upon an analysis of their parameters. Several well known recursive algorithms are then classified according to this scheme. The classification is used to determine if strategies for effecting significant savings in computation time of a recursive algorithm can be developed. Such strategies and the results of applying them are also discussed.

References

[1]
Ellis Horowitz & Sartaj Sahni, Fundamentals of Data Structure~ In Pascal, Computer Science Press, 1984, 542pp.
[2]
Robert L. Kruse, 'On Teachlng Recurslon', SIGISSE Bulletin, Vol ! 4,Number I, ( ! 982), pp.92-g6
[3]
Stephen B. Maurer, 'The Algorlthmlc Way of Life Is Best', College Mathematics Journal, Vol 16, Number t, (1985), pp .2- i8

Recommendations

Reviews

Herbert A. Klaeren

The authors discuss a strategy for recursion removal under the aspect of teaching it in a computer science curriculum. The strategy is based on the assumption that at least one parameter of the recursive definition is a nonnegative integer which can be understood as describing the distance of a recursive call to the primitive case. The authors seemingly are not aware of the extensive literature on program transformations and recursion removal; their proposed strategy is relatively weak compared to methods published elsewhere.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin
ACM SIGCSE Bulletin  Volume 18, Issue 1
Proceedings of the 17th SIGCSE symposium on Computer science education
February 1986
304 pages
ISSN:0097-8418
DOI:10.1145/953055
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
    February 1986
    336 pages
    ISBN:0897911784
    DOI:10.1145/5600
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1986
Published in SIGCSE Volume 18, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)65
  • Downloads (Last 6 weeks)19
Reflects downloads up to 23 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media