Using computer algebra systems in the teaching of analysis of recursive functions

  • Authors:
  • James Harris

  • Affiliations:
  • Georgia Southern University, Statesboro, GA

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many of the methods used in algorithm analysis often involve mathematics at the calculus III level or higher. Most computer science undergraduate programs do not require analysis beyond calculus II. A course in algorithmic analysis and design or data structures can easily turn into a course in mathematical analysis if algorithmic analysis is covered in depth. Generating functions and asymptotic approximations alone can take up a good part of the semester. This paper describes ways in which a computer algebra system, in this case Maple, can be used to help with the teaching of analysis of algorithms