On classifying recursive algorithms

Authors:
L. Carl Leinbach;Alex L. Wijesinha
Affiliations:
Gettysburg College, Gettysburg, PA;Gettysburg College, Gettysburg, PA
Venue:
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
Year:
1986

Citing 2
Cited 0

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
On teaching recursion

SIGCSE '82 Proceedings of the thirteenth SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

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.