On classifying recursive algorithms

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

• 2: Ellis Horowitz , Sartaj Sahni, Fundamentals of data structures in PASCAL, Computer Science Press, Inc., New York, NY, 1984
• 3: Robert L. Kruse, On teaching recursion, ACM SIGCSE Bulletin, v.14 n.1, p.92-96, February 1982
• 4: Stephen B. Maurer, 'The Algorlthmlc Way of Life Is Best', College Mathematics Journal, Vol 16, Number t, (1985), pp .2- i8

INDEX TERMS

Classification:
  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.3 Studies of Program Constructs
          Subjects: Program and recursion schemes

  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

General Terms:
Algorithms, Theory