Recursion in Java: A Quantative Analysis

Free registration required

Executive Summary

Many problems are solved most readily with recursive algorithms, and recursive algorithms are often shorter and clearer than their iterative counterparts. Recursive algorithm description is typically more elegant and concise than iterative version of the program. The software's based on recursion are condemned for many years because compilers could not deal efficiently with the overhead of the recursive function call. However, this situation is changing; modern compilers can handle recursion overhead efficiently because of transformation techniques. Performance of computation depends upon construction of compiler, algorithm and hardware design. This paper studied the performance of recursive and iterative programs on two different machines and two different versions of JAVA compiler.

  • Format: PDF
  • Size: 106.7 KB