Study of Recursive and Iterative Approach on Factorial and Fibonacci Algorithm

Abstract

Algorithm is wide area for research. In part of algorithm is solved various real time
problem like job scheduling, shortest path and Eight Queen etc. For finding a solution multiple
approaches work on single problem. In this paper we work on that direction. There are two main
basic algorithm can be implemented in different nature. In this paper we study factorial and
Fibonacci algorithm solved by simple iterative approach and recursive approach. At last we
compare number of parameter like their number of operation, memory utilization and Time
complexity