Year: 1986
Type: conference-paper
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.
DOI: 10.1145/5600.5644
Authors: L. Carl Leinbach, Alex L. Wijesinha
Institution: Gettysburg College
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4233490695